Intra prediction-based image coding method and apparatus using mpm list

ABSTRACT

A video decoding method according to this document includes constructing a most probable mode (MPM) list by deriving MPM candidates for a current block based on a neighboring block adjacent to the current block, deriving an intra prediction mode for the current block based on the MPM list, generating predicted samples by performing prediction for the current block based on the intra prediction mode, and generating a reconstructed picture for the current block based on the predicted samples.

CROSS-REFERENCE TO RELATED APPLICATIONS

Pursuant to 35 U.S.C. § 119(e), this application is a bypasscontinuation of International Application PCT/KR2019/013072, with aninternational filing date of Oct. 4, 2019, which claims the benefit ofU.S. Provisional Applications No. 62/742,242 filed on Oct. 5, 2018 andNo. 62/742,975 filed on Oct. 9, 2018, the contents of which are allhereby incorporated by reference herein in their entirety.

BACKGROUND Field

This document relates to an image coding technology and, moreparticularly, to a video coding method and apparatus using an intraprediction based on an MPM list.

Related Art

The demands for high-resolution and high-quality images and video, suchas an ultra high definition (UHD) image and video of 4K or 8K or more,are recently increasing in various fields. As image and video databecome high resolution and high quality, the amount of information orthe number of bits that is relatively transmitted is increased comparedto the existing image and video data. Accordingly, if image data istransmitted using a medium, such as the existing wired or wirelesswideband line, or image and video data are stored using the existingstorage medium, transmission costs and storage costs are increased.

Furthermore, interests and demands for immersive media, such as virtualreality (VR), artificial reality (AR) content or a hologram, arerecently increasing. The broadcasting of an image and video having imagecharacteristics different from those of real images, such as gameimages, is increasing.

Accordingly, there is a need for a high-efficiency image and videocompression technology in order to effectively compress and transmit orstore and playback information of high-resolution and high-qualityimages and video having such various characteristics.

SUMMARY

This document provides a method and apparatus for enhancing image codingefficiency.

This document provides an efficient intra prediction method andapparatus.

This document provides a video coding method and apparatus for derivingan MPM list for an efficient intra prediction.

This document provides an image coding method and apparatus capable ofreducing signaling overhead by efficiently coding information related toan intra prediction.

In an aspect, there is provided a video decoding method performed by adecoding apparatus. The method includes constructing a most probablemode (MPM) list by deriving MPM candidates for a current block based ona neighboring block adjacent to the current block, deriving an intraprediction mode for the current block based on the MPM list, generatingpredicted samples by performing prediction for the current block basedon the intra prediction mode, and generating a reconstructed picture forthe current block based on the predicted samples. The step of derivingthe intra prediction mode for the current block includes obtaining MPMflag information related to whether the intra prediction mode for thecurrent block is included among the MPM candidates in the MPM list,obtaining remaining mode information for indicating the intra predictionmode for the current block among remaining intra prediction modes exceptfor the MPM candidates, when it is determined that the intra predictionmode for the current block is not included among the MPM candidates inthe MPM list based on the MPM flag information, and deriving the intraprediction mode for the current block based on the remaining modeinformation. The remaining mode information is obtained based on abinarization process.

In another aspect, there is provided a video encoding method performedby an encoding apparatus. The method includes constructing a mostprobable mode (MPM) list by deriving MPM candidates for a current blockbased on a neighboring block adjacent to a current block, determining anintra prediction mode for the current block, generating predictionsamples by performing a prediction for the current block based on theintra prediction mode, and encoding image information including intraprediction mode information for the current block. The step ofdetermining the intra prediction mode for the current block includesgenerating MPM flag information based on whether the intra predictionmode for the current block is included among the MPM candidates in theMPM list, and generating remaining mode information for indicating theintra prediction mode for the current block among remaining intraprediction modes except the MPM candidates, when it is determined thatthe intra prediction mode for the current block is not included amongthe MPM candidates in the MPM list based on the MPM flag information.The MPM flag information and the remaining mode information are includedand encoded in the intra prediction mode information. The remaining modeinformation is encoded based on a binarization process.

According to this document, overall image and video compressionefficiency can be enhanced.

According to this document, computational complexity can be reduced andoverall coding efficiency can be improved through an efficient intraprediction.

According to this document, an MPM list can be efficiently constructedby considering an increase in the number of intra prediction modes.Furthermore, the accuracy of an MPM list for indicating an intraprediction mode of a current block can be improved, and overall codingefficiency can be improved.

According to this document, signaling overhead can be reduced becauseinformation related to an intra prediction mode can be efficientlycoded.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 schematically illustrates an example of a video/image codingsystem to which embodiments of this document may be applied.

FIG. 2 is a diagram schematically describing the configuration of avideo/video encoding apparatus to which embodiments of this document maybe applied.

FIG. 3 is a diagram schematically describing the configuration of avideo/image decoding apparatus to which embodiments of this document maybe applied.

FIG. 4 illustrates an example of a video encoding method performed by avideo encoding apparatus.

FIG. 5 illustrates an example of a video coding method performed by adecoding apparatus.

FIG. 6 illustrates an example of a video encoding method based on anintra prediction and FIG. 7 schematically illustrates an intra predictorwithin the encoding apparatus.

FIG. 8 illustrates an example of a video coding method based on an intraprediction and FIG. 9 schematically illustrates an intra predictorwithin the decoding apparatus.

FIG. 10 illustrates 65 directional intra prediction modes.

FIG. 11 illustrates neighboring blocks of a current block.

FIGS. 12 and 13 are flowcharts schematically illustrating a method ofconfiguring an MPM list for a current block.

FIG. 14 is a flowchart illustrating an embodiment of a method ofconfiguring an MPM list for a current block.

FIG. 15 is a flowchart schematically illustrating an encoding methodwhich may be performed by the encoding apparatus according to anembodiment of this document.

FIG. 16 is a flowchart schematically illustrating a decoding methodwhich may be performed by the decoding apparatus according to anembodiment of this document.

FIG. 17 illustrates an example of a content streaming system to whichembodiments disclosed in this document may be applied.

DESCRIPTION OF EXEMPLARY EMBODIMENTS

This document may be modified in various ways and may have variousembodiments, and specific embodiments will be illustrated in thedrawings and described in detail. However, this does not intend to limitthis document to the specific embodiments. Terms commonly used in thisspecification are used to describe a specific embodiment and is not usedto limit the technical spirit of this document. An expression of thesingular number includes plural expressions unless evidently expressedotherwise in the context. A term, such as “include” or “have” in thisspecification, should be understood to indicate the existence of acharacteristic, number, step, operation, element, part, or a combinationof them described in the specification and not to exclude the existenceor the possibility of the addition of one or more other characteristics,numbers, steps, operations, elements, parts or a combination of them.

Meanwhile, elements in the drawings described in this document areindependently illustrated for convenience of description related todifferent characteristic functions. This does not mean that each of theelements is implemented as separate hardware or separate software. Forexample, at least two of elements may be combined to form a singleelement, or a single element may be divided into a plurality ofelements. An embodiment in which elements are combined and/or separatedis also included in the scope of rights of this document unless itdeviates from the essence of this document.

Hereinafter, preferred embodiments of this document are described morespecifically with reference to the accompanying drawings. Hereinafter,in the drawings, the same reference numeral is used in the same element,and a redundant description of the same element may be omitted.

FIG. 1 schematically illustrates an example of a video/image codingsystem to which embodiments of this document may be applied.

Referring to FIG. 1 , a video/image coding system may include a firstdevice (source device) and a second device (receiving device). Thesource device may deliver encoded video/image information or data in theform of a file or streaming to the receiving device via a digitalstorage medium or network.

The source device may include a video source, an encoding apparatus, anda transmitter. The receiving device may include a receiver, a decodingapparatus, and a renderer. The encoding apparatus may be called avideo/image encoding apparatus, and the decoding apparatus may be calleda video/image decoding apparatus. The transmitter may be included in theencoding apparatus. The receiver may be included in the decodingapparatus. The renderer may include a display, and the display may beconfigured as a separate device or an external component.

The video source may acquire video/image through a process of capturing,synthesizing, or generating the video/image. The video source mayinclude a video/image capture device and/or a video/image generatingdevice. The video/image capture device may include, for example, one ormore cameras, video/image archives including previously capturedvideo/images, and the like. The video/image generating device mayinclude, for example, computers, tablets and smartphones, and may(electronically) generate video/images. For example, a virtualvideo/image may be generated through a computer or the like. In thiscase, the video/image capturing process may be replaced by a process ofgenerating related data.

The encoding apparatus may encode input video/image. The encodingapparatus may perform a series of procedures such as prediction,transform, and quantization for compression and coding efficiency. Theencoded data (encoded video/image information) may be output in the formof a bitstream.

The transmitter may transmit the encoded image/image information or dataoutput in the form of a bitstream to the receiver of the receivingdevice through a digital storage medium or a network in the form of afile or streaming. The digital storage medium may include variousstorage mediums such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and thelike. The transmitter may include an element for generating a media filethrough a predetermined file format and may include an element fortransmission through a broadcast/communication network. The receiver mayreceive/extract the bitstream and transmit the received bitstream to thedecoding apparatus.

The decoding apparatus may decode the video/image by performing a seriesof procedures such as dequantization, inverse transform, and predictioncorresponding to the operation of the encoding apparatus.

The renderer may render the decoded video/image. The renderedvideo/image may be displayed through the display.

This document relates to video/image coding. For example, themethods/embodiments disclosed in this document may be applied to amethod disclosed in the versatile video coding (VVC), the EVC (essentialvideo coding) standard, the AOMedia Video 1 (AV1) standard, the 2ndgeneration of audio video coding standard (AVS2), or the next generationvideo/image coding standard (ex. H.267 or H.268, etc.).

This document presents various embodiments of video/image coding, andthe embodiments may be performed in combination with each other unlessotherwise mentioned.

In this document, video may refer to a series of images over time.Picture generally refers to a unit representing one image in a specifictime zone, and a slice/tile is a unit constituting part of a picture incoding. The slice/tile may include one or more coding tree units (CTUs).One picture may consist of one or more slices/tiles. One picture mayconsist of one or more tile groups. One tile group may include one ormore tiles. A brick may represent a rectangular region of CTU rowswithin a tile in a picture. A tile may be partitioned into multiplebricks, each of which consisting of one or more CTU rows within thetile. A tile that is not partitioned into multiple bricks may be alsoreferred to as a brick. A brick scan is a specific sequential orderingof CTUs partitioning a picture in which the CTUs are orderedconsecutively in CTU raster scan in a brick, bricks within a tile areordered consecutively in a raster scan of the bricks of the tile, andtiles in a picture are ordered consecutively in a raster scan of thetiles of the picture. A tile is a rectangular region of CTUs within aparticular tile column and a particular tile row in a picture. The tilecolumn is a rectangular region of CTUs having a height equal to theheight of the picture and a width specified by syntax elements in thepicture parameter set. The tile row is a rectangular region of CTUshaving a height specified by syntax elements in the picture parameterset and a width equal to the width of the picture. A tile scan is aspecific sequential ordering of CTUs partitioning a picture in which theCTUs are ordered consecutively in CTU raster scan in a tile whereastiles in a picture are ordered consecutively in a raster scan of thetiles of the picture. A slice includes an integer number of bricks of apicture that may be exclusively contained in a single NAL unit. A slicemay consist of either the number of complete tiles or only a consecutivesequence of complete bricks of one tile. Tile groups and slices may beused interchangeably in this document. For example, in this document, atile group/tile group header may be called a slice/slice header.

A pixel or a pel may mean a smallest unit constituting one picture (orimage). Also, ‘sample’ may be used as a term corresponding to a pixel. Asample may generally represent a pixel or a value of a pixel, and mayrepresent only a pixel/pixel value of a luma component or only apixel/pixel value of a chroma component.

A unit may represent a basic unit of image processing. The unit mayinclude at least one of a specific region of the picture and informationrelated to the region. One unit may include one luma block and twochroma (ex. cb, cr) blocks. The unit may be used interchangeably withterms such as block or area in some cases. In a general case, an M×Nblock may include samples (or sample arrays) or a set (or array) oftransform coefficients of M columns and N rows.

In this document, the term “/” and “,” should be interpreted to indicate“and/or.” For instance, the expression “A/B” may mean “A and/or B.”Further, “A, B” may mean “A and/or B.” Further, “A/B/C” may mean “atleast one of A, B, and/or C.” Also, “A/B/C” may mean “at least one of A,B, and/or C.”

Further, in the document, the term “or” should be interpreted toindicate “and/or.” For instance, the expression “A or B” may comprise 1)only A, 2) only B, and/or 3) both A and B. In other words, the term “or”in this document should be interpreted to indicate “additionally oralternatively.”

FIG. 2 is a schematic diagram illustrating a configuration of avideo/image encoding apparatus to which the embodiment(s) of the presentdocument may be applied. Hereinafter, the video encoding apparatus mayinclude an image encoding apparatus.

Referring to FIG. 2 , the encoding apparatus 200 includes an imagepartitioner 210, a predictor 220, a residual processor 230, and anentropy encoder 240, an adder 250, a filter 260, and a memory 270. Thepredictor 220 may include an inter predictor 221 and an intra predictor222. The residual processor 230 may include a transformer 232, aquantizer 233, a dequantizer 234, and an inverse transformer 235. Theresidual processor 230 may further include a subtractor 231. The adder250 may be called a reconstructor or a reconstructed block generator.The image partitioner 210, the predictor 220, the residual processor230, the entropy encoder 240, the adder 250, and the filter 260 may beconfigured with at least one hardware component (ex. an encoder chipsetor processor) according to an embodiment. In addition, the memory 270may include a decoded picture buffer (DPB) or may be configured with adigital storage medium. The hardware component may further include thememory 270 as an internal/external component.

The image partitioner 210 may partition an input image (or a picture ora frame) input to the encoding apparatus 200 into one or moreprocessors. For example, the processor may be called a coding unit (CU).In this case, the coding unit may be recursively partitioned accordingto a quad-tree binary-tree ternary-tree (QTBTTT) structure from a codingtree unit (CTU) or a largest coding unit (LCU). For example, one codingunit may be partitioned into a plurality of coding units of a deeperdepth based on a quad tree structure, a binary tree structure, and/or aternary structure. In this case, for example, the quad tree structuremay be applied first and the binary tree structure and/or ternarystructure may be applied later. Alternatively, the binary tree structuremay be applied first. The coding procedure according to this documentmay be performed based on the final coding unit that is no longerpartitioned. In this case, the largest coding unit may be used as thefinal coding unit based on coding efficiency according to imagecharacteristics, or if necessary, the coding unit may be recursivelypartitioned into coding units of deeper depth and a coding unit havingan optimal size may be used as the final coding unit. Here, the codingprocedure may include a procedure of prediction, transform, andreconstruction, which will be described later. As another example, theprocessor may further include a prediction unit (PU) or a transform unit(TU). In this case, the prediction unit and the transform unit may besplit or partitioned from the aforementioned final coding unit. Theprediction unit may be a unit of sample prediction, and the transformunit may be a unit for deriving a transform coefficient and/or a unitfor deriving a residual signal from the transform coefficient.

The unit may be used interchangeably with terms such as block or area insome cases. In a general case, an M×N block may represent a set ofsamples or transform coefficients composed of M columns and N rows. Asample may generally represent a pixel or a value of a pixel, mayrepresent only a pixel/pixel value of a luma component or represent onlya pixel/pixel value of a chroma component. A sample may be used as aterm corresponding to one picture (or image) for a pixel or a pel.

In the encoding apparatus 200, a prediction signal (predicted block,prediction sample array) output from the inter predictor 221 or theintra predictor 222 is subtracted from an input image signal (originalblock, original sample array) to generate a residual signal residualblock, residual sample array), and the generated residual signal istransmitted to the transformer 232. In this case, as shown, a unit forsubtracting a prediction signal (predicted block, prediction samplearray) from the input image signal (original block, original samplearray) in the encoder 200 may be called a subtractor 231. The predictormay perform prediction on a block to be processed (hereinafter, referredto as a current block) and generate a predicted block includingprediction samples for the current block. The predictor may determinewhether intra prediction or inter prediction is applied on a currentblock or CU basis. As described later in the description of eachprediction mode, the predictor may generate various information relatedto prediction, such as prediction mode information, and transmit thegenerated information to the entropy encoder 240. The information on theprediction may be encoded in the entropy encoder 240 and output in theform of a bitstream.

The intra predictor 222 may predict the current block by referring tothe samples in the current picture. The referred samples may be locatedin the neighborhood of the current block or may be located apartaccording to the prediction mode. In the intra prediction, predictionmodes may include a plurality of non-directional modes and a pluralityof directional modes. The non-directional mode may include, for example,a DC mode and a planar mode. The directional mode may include, forexample, 33 directional prediction modes or 65 directional predictionmodes according to the degree of detail of the prediction direction.However, this is merely an example, more or less directional predictionmodes may be used depending on a setting. The intra predictor 222 maydetermine the prediction mode applied to the current block by using aprediction mode applied to a neighboring block.

The inter predictor 221 may derive a predicted block for the currentblock based on a reference block (reference sample array) specified by amotion vector on a reference picture. Here, in order to reduce theamount of motion information transmitted in the inter prediction mode,the motion information may be predicted in units of blocks, subblocks,or samples based on correlation of motion information between theneighboring block and the current block. The motion information mayinclude a motion vector and a reference picture index. The motioninformation may further include inter prediction direction (L0prediction, L1 prediction, Bi prediction, etc.) information. In the caseof inter prediction, the neighboring block may include a spatialneighboring block present in the current picture and a temporalneighboring block present in the reference picture. The referencepicture including the reference block and the reference pictureincluding the temporal neighboring block may be the same or different.The temporal neighboring block may be called a collocated referenceblock, a co-located CU (colCU), and the like, and the reference pictureincluding the temporal neighboring block may be called a collocatedpicture (colPic). For example, the inter predictor 221 may configure amotion information candidate list based on neighboring blocks andgenerate information indicating which candidate is used to derive amotion vector and/or a reference picture index of the current block.Inter prediction may be performed based on various prediction modes. Forexample, in the case of a skip mode and a merge mode, the interpredictor 221 may use motion information of the neighboring block asmotion information of the current block. In the skip mode, unlike themerge mode, the residual signal may not be transmitted. In the case ofthe motion vector prediction (MVP) mode, the motion vector of theneighboring block may be used as a motion vector predictor and themotion vector of the current block may be indicated by signaling amotion vector difference.

The predictor 220 may generate a prediction signal based on variousprediction methods described below. For example, the predictor may notonly apply intra prediction or inter prediction to predict one block butalso simultaneously apply both intra prediction and inter prediction.This may be called combined inter and intra prediction (CIIP). Inaddition, the predictor may be based on an intra block copy (IBC)prediction mode or a palette mode for prediction of a block. The IBCprediction mode or palette mode may be used for content image/videocoding of a game or the like, for example, screen content coding (SCC).The IBC basically performs prediction in the current picture but may beperformed similarly to inter prediction in that a reference block isderived in the current picture. That is, the IBC may use at least one ofthe inter prediction techniques described in this document. The palettemode may be considered as an example of intra coding or intraprediction. When the palette mode is applied, a sample value within apicture may be signaled based on information on the palette table andthe palette index.

The prediction signal generated by the predictor (including the interpredictor 221 and/or the intra predictor 222) may be used to generate areconstructed signal or to generate a residual signal. The transformer232 may generate transform coefficients by applying a transformtechnique to the residual signal. For example, the transform techniquemay include at least one of a discrete cosine transform (DCT), adiscrete sine transform (DST), a karhunen-loéve transform (KLT), agraph-based transform (GBT), or a conditionally non-linear transform(CNT). Here, the GBT means transform obtained from a graph whenrelationship information between pixels is represented by the graph. TheCNT refers to transform generated based on a prediction signal generatedusing all previously reconstructed pixels. In addition, the transformprocess may be applied to square pixel blocks having the same size ormay be applied to blocks having a variable size rather than square.

The quantizer 233 may quantize the transform coefficients and transmitthem to the entropy encoder 240 and the entropy encoder 240 may encodethe quantized signal (information on the quantized transformcoefficients) and output a bitstream. The information on the quantizedtransform coefficients may be referred to as residual information. Thequantizer 233 may rearrange block type quantized transform coefficientsinto a one-dimensional vector form based on a coefficient scanning orderand generate information on the quantized transform coefficients basedon the quantized transform coefficients in the one-dimensional vectorform. Information on transform coefficients may be generated. Theentropy encoder 240 may perform various encoding methods such as, forexample, exponential Golomb, context-adaptive variable length coding(CAVLC), context-adaptive binary arithmetic coding (CABAC), and thelike. The entropy encoder 240 may encode information necessary forvideo/image reconstruction other than quantized transform coefficients(ex. values of syntax elements, etc.) together or separately. Encodedinformation (ex. encoded video/image information) may be transmitted orstored in units of NALs (network abstraction layer) in the form of abitstream. The video/image information may further include informationon various parameter sets such as an adaptation parameter set (APS), apicture parameter set (PPS), a sequence parameter set (SPS), or a videoparameter set (VPS). In addition, the video/image information mayfurther include general constraint information. In this document,information and/or syntax elements transmitted/signaled from theencoding apparatus to the decoding apparatus may be included invideo/picture information. The video/image information may be encodedthrough the above-described encoding procedure and included in thebitstream. The bitstream may be transmitted over a network or may bestored in a digital storage medium. The network may include abroadcasting network and/or a communication network, and the digitalstorage medium may include various storage media such as USB, SD, CD,DVD, Blu-ray, HDD, SSD, and the like. A transmitter (not shown)transmitting a signal output from the entropy encoder 240 and/or astorage unit (not shown) storing the signal may be included asinternal/external element of the encoding apparatus 200, andalternatively, the transmitter may be included in the entropy encoder240.

The quantized transform coefficients output from the quantizer 233 maybe used to generate a prediction signal. For example, the residualsignal (residual block or residual samples) may be reconstructed byapplying dequantization and inverse transform to the quantized transformcoefficients through the dequantizer 234 and the inverse transformer235. The adder 250 adds the reconstructed residual signal to theprediction signal output from the inter predictor 221 or the intrapredictor 222 to generate a reconstructed signal (reconstructed picture,reconstructed block, reconstructed sample array). If there is noresidual for the block to be processed, such as a case where the skipmode is applied, the predicted block may be used as the reconstructedblock. The adder 250 may be called a reconstructor or a reconstructedblock generator. The generated reconstructed signal may be used forintra prediction of a next block to be processed in the current pictureand may be used for inter prediction of a next picture through filteringas described below.

Meanwhile, luma mapping with chroma scaling (LMCS) may be applied duringpicture encoding and/or reconstruction.

The filter 260 may improve subjective/objective image quality byapplying filtering to the reconstructed signal. For example, the filter260 may generate a modified reconstructed picture by applying variousfiltering methods to the reconstructed picture and store the modifiedreconstructed picture in the memory 270, specifically, a DPB of thememory 270. The various filtering methods may include, for example,deblocking filtering, a sample adaptive offset, an adaptive loop filter,a bilateral filter, and the like. The filter 260 may generate variousinformation related to the filtering and transmit the generatedinformation to the entropy encoder 240 as described later in thedescription of each filtering method. The information related to thefiltering may be encoded by the entropy encoder 240 and output in theform of a bitstream.

The modified reconstructed picture transmitted to the memory 270 may beused as the reference picture in the inter predictor 221. When the interprediction is applied through the encoding apparatus, predictionmismatch between the encoding apparatus 200 and the decoding apparatusmay be avoided and encoding efficiency may be improved.

The DPB of the memory 270 DPB may store the modified reconstructedpicture for use as a reference picture in the inter predictor 221. Thememory 270 may store the motion information of the block from which themotion information in the current picture is derived (or encoded) and/orthe motion information of the blocks in the picture that have alreadybeen reconstructed. The stored motion information may be transmitted tothe inter predictor 221 and used as the motion information of thespatial neighboring block or the motion information of the temporalneighboring block. The memory 270 may store reconstructed samples ofreconstructed blocks in the current picture and may transfer thereconstructed samples to the intra predictor 222.

FIG. 3 is a schematic diagram illustrating a configuration of avideo/image decoding apparatus to which the embodiment(s) of the presentdocument may be applied.

Referring to FIG. 3 , the decoding apparatus 300 may include an entropydecoder 310, a residual processor 320, a predictor 330, an adder 340, afilter 350, a memory 360. The predictor 330 may include an interpredictor 331 and an intra predictor 332. The residual processor 320 mayinclude a dequantizer 321 and an inverse transformer 322. The entropydecoder 310, the residual processor 320, the predictor 330, the adder340, and the filter 350 may be configured with a hardware component (ex.a decoder chipset or a processor) according to an embodiment. Inaddition, the memory 360 may include a decoded picture buffer (DPB) ormay be configured with a digital storage medium. The hardware componentmay further include the memory 360 as an internal/external component.

When a bitstream including video/image information is input, thedecoding apparatus 300 may reconstruct an image corresponding to aprocess in which the video/image information is processed in theencoding apparatus of FIG. 2 . For example, the decoding apparatus 300may derive units/blocks based on block partition related informationobtained from the bitstream. The decoding apparatus 300 may performdecoding using a processor applied in the encoding apparatus. Thus, theprocessor of decoding may be a coding unit, for example, and the codingunit may be partitioned according to a quad tree structure, binary treestructure and/or ternary tree structure from the coding tree unit or thelargest coding unit. One or more transform units may be derived from thecoding unit. The reconstructed image signal decoded and output throughthe decoding apparatus 300 may be reproduced through a reproducingapparatus.

The decoding apparatus 300 may receive a signal output from the encodingapparatus of FIG. 2 in the form of a bitstream, and the received signalmay be decoded through the entropy decoder 310. For example, the entropydecoder 310 may parse the bitstream to derive information (ex.video/image information) necessary for image reconstruction (or picturereconstruction). The video/image information may further includeinformation on various parameter sets such as an adaptation parameterset (APS), a picture parameter set (PPS), a sequence parameter set(SPS), or a video parameter set (VPS). In addition, the video/imageinformation may further include general constraint information. Thedecoding apparatus may further decode picture based on the informationon the parameter set and/or the general constraint information.Signaled/received information and/or syntax elements described later inthis document may be decoded may decode the decoding procedure andobtained from the bitstream. For example, the entropy decoder 310decodes the information in the bitstream based on a coding method suchas exponential Golomb coding, CAVLC, or CABAC, and output syntaxelements required for image reconstruction and quantized values oftransform coefficients for residual. More specifically, the CABACentropy decoding method may receive a bin corresponding to each syntaxelement in the bitstream, determine a context model using a decodingtarget syntax element information, decoding information of a decodingtarget block or information of a symbol/bin decoded in a previous stage,and perform an arithmetic decoding on the bin by predicting aprobability of occurrence of a bin according to the determined contextmodel, and generate a symbol corresponding to the value of each syntaxelement. In this case, the CABAC entropy decoding method may update thecontext model by using the information of the decoded symbol/bin for acontext model of a next symbol/bin after determining the context model.The information related to the prediction among the information decodedby the entropy decoder 310 may be provided to the predictor (the interpredictor 332 and the intra predictor 331), and the residual value onwhich the entropy decoding was performed in the entropy decoder 310,that is, the quantized transform coefficients and related parameterinformation, may be input to the residual processor 320. The residualprocessor 320 may derive the residual signal (the residual block, theresidual samples, the residual sample array). In addition, informationon filtering among information decoded by the entropy decoder 310 may beprovided to the filter 350. Meanwhile, a receiver (not shown) forreceiving a signal output from the encoding apparatus may be furtherconfigured as an internal/external element of the decoding apparatus300, or the receiver may be a component of the entropy decoder 310.Meanwhile, the decoding apparatus according to this document may bereferred to as a video/image/picture decoding apparatus, and thedecoding apparatus may be classified into an information decoder(video/image/picture information decoder) and a sample decoder(video/image/picture sample decoder). The information decoder mayinclude the entropy decoder 310, and the sample decoder may include atleast one of the dequantizer 321, the inverse transformer 322, the adder340, the filter 350, the memory 360, the inter predictor 332, and theintra predictor 331.

The dequantizer 321 may dequantize the quantized transform coefficientsand output the transform coefficients. The dequantizer 321 may rearrangethe quantized transform coefficients in the form of a two-dimensionalblock form. In this case, the rearrangement may be performed based onthe coefficient scanning order performed in the encoding apparatus. Thedequantizer 321 may perform dequantization on the quantized transformcoefficients by using a quantization parameter (ex. quantization stepsize information) and obtain transform coefficients.

The inverse transformer 322 inversely transforms the transformcoefficients to obtain a residual signal (residual block, residualsample array).

The predictor may perform prediction on the current block and generate apredicted block including prediction samples for the current block. Thepredictor may determine whether intra prediction or inter prediction isapplied to the current block based on the information on the predictionoutput from the entropy decoder 310 and may determine a specificintra/inter prediction mode.

The predictor 320 may generate a prediction signal based on variousprediction methods described below. For example, the predictor may notonly apply intra prediction or inter prediction to predict one block butalso simultaneously apply intra prediction and inter prediction. Thismay be called combined inter and intra prediction (CIIP). In addition,the predictor may be based on an intra block copy (IBC) prediction modeor a palette mode for prediction of a block. The IBC prediction mode orpalette mode may be used for content image/video coding of a game or thelike, for example, screen content coding (SCC). The IBC basicallyperforms prediction in the current picture but may be performedsimilarly to inter prediction in that a reference block is derived inthe current picture. That is, the IBC may use at least one of the interprediction techniques described in this document. The palette mode maybe considered as an example of intra coding or intra prediction. Whenthe palette mode is applied, a sample value within a picture may besignaled based on information on the palette table and the paletteindex.

The intra predictor 331 may predict the current block by referring tothe samples in the current picture. The referred samples may be locatedin the neighborhood of the current block or may be located apartaccording to the prediction mode. In the intra prediction, predictionmodes may include a plurality of non-directional modes and a pluralityof directional modes. The intra predictor 331 may determine theprediction mode applied to the current block by using a prediction modeapplied to a neighboring block.

The inter predictor 332 may derive a predicted block for the currentblock based on a reference block (reference sample array) specified by amotion vector on a reference picture. In this case, in order to reducethe amount of motion information transmitted in the inter predictionmode, motion information may be predicted in units of blocks, subblocks,or samples based on correlation of motion information between theneighboring block and the current block. The motion information mayinclude a motion vector and a reference picture index. The motioninformation may further include inter prediction direction (L0prediction, L1 prediction, Bi prediction, etc.) information. In the caseof inter prediction, the neighboring block may include a spatialneighboring block present in the current picture and a temporalneighboring block present in the reference picture. For example, theinter predictor 332 may configure a motion information candidate listbased on neighboring blocks and derive a motion vector of the currentblock and/or a reference picture index based on the received candidateselection information. Inter prediction may be performed based onvarious prediction modes, and the information on the prediction mayinclude information indicating a mode of inter prediction for thecurrent block.

The adder 340 may generate a reconstructed signal (reconstructedpicture, reconstructed block, reconstructed sample array) by adding theobtained residual signal to the prediction signal (predicted block,predicted sample array) output from the predictor (including the interpredictor 332 and/or the intra predictor 331). If there is no residualfor the block to be processed, such as when the skip mode is applied,the predicted block may be used as the reconstructed block.

The adder 340 may be called reconstructor or a reconstructed blockgenerator. The generated reconstructed signal may be used for intraprediction of a next block to be processed in the current picture, maybe output through filtering as described below, or may be used for interprediction of a next picture.

Meanwhile, luma mapping with chroma scaling (LMCS) may be applied in thepicture decoding process.

The filter 350 may improve subjective/objective image quality byapplying filtering to the reconstructed signal. For example, the filter350 may generate a modified reconstructed picture by applying variousfiltering methods to the reconstructed picture and store the modifiedreconstructed picture in the memory 360, specifically, a DPB of thememory 360. The various filtering methods may include, for example,deblocking filtering, a sample adaptive offset, an adaptive loop filter,a bilateral filter, and the like.

The (modified) reconstructed picture stored in the DPB of the memory 360may be used as a reference picture in the inter predictor 332. Thememory 360 may store the motion information of the block from which themotion information in the current picture is derived (or decoded) and/orthe motion information of the blocks in the picture that have alreadybeen reconstructed. The stored motion information may be transmitted tothe inter predictor 260 so as to be utilized as the motion informationof the spatial neighboring block or the motion information of thetemporal neighboring block. The memory 360 may store reconstructedsamples of reconstructed blocks in the current picture and transfer thereconstructed samples to the intra predictor 331.

In the present disclosure, the embodiments described in the filter 260,the inter predictor 221, and the intra predictor 222 of the encodingapparatus 200 may be the same as or respectively applied to correspondto the filter 350, the inter predictor 332, and the intra predictor 331of the decoding apparatus 300. The same may also apply to the unit 332and the intra predictor 331.

As described above, in performing video coding, a prediction isperformed to enhance compression efficiency. A predicted block includingprediction samples for a current block, that is, a target coding block,can be generated through the prediction. In this case, the predictedblock includes the prediction samples in a spatial domain (or pixeldomain). The predicted block is identically derived in the encodingapparatus and the decoding apparatus. The encoding apparatus can enhanceimage coding efficiency by signaling, to the decoding apparatus,information on a residual (residual information) between the originalblock not an original sample value itself of the original block and thepredicted block. The decoding apparatus may derive a residual blockincluding residual samples based on the residual information, maygenerate a reconstructed including reconstructed samples by adding theresidual block and the predicted block, and may generate a reconstructedpicture including the reconstructed blocks.

The residual information may be generated through a transform andquantization procedure. For example, the encoding apparatus may derivethe residual block between the original block and the predicted block,may derive transform coefficients by performing a transform procedure onthe residual samples (residual sample array) included in the residualblock, may derive quantized transform coefficients by performing aquantization procedure on the transform coefficients, and may signalrelated residual information to the decoding apparatus (through abitstream). In this case, the residual information may includeinformation, such as value information, location information, transformscheme, transform kernel, and quantization parameter of the quantizedtransform coefficients. The decoding apparatus may perform adequantization/inverse transform procedure based on the residualinformation, and may derive residual samples (or residual block). Thedecoding apparatus may generate a reconstructed picture based on thepredicted block and the residual block. Furthermore, the encodingapparatus may derive a residual block bydequantizing/inverse-transforming the quantized transform coefficientsfor reference to the inter prediction of a subsequent picture, and maygenerate a reconstructed picture.

FIG. 4 illustrates an example of a video encoding method performed by avideo encoding apparatus.

Referring to FIG. 4 , the video encoding method may include blockpartitioning, intra/inter prediction, transform, quantization andentropy encoding processes. For example, a current picture may bepartitioned into a plurality of blocks. A prediction block of a currentblock may be generated through an intra/inter prediction. A residualblock of the current block may be generated through a subtractionbetween an input block of the current block and the prediction block.Thereafter, a coefficient block, that is, transform coefficients of thecurrent block, may be generated through a transform for the residualblock. The transform coefficients may be quantized and entropy-encodedand stored in a bitstream.

FIG. 5 illustrates an example of a video coding method performed by adecoding apparatus.

Referring to FIG. 5 , the image coding method may include entropydecoding, inverse quantization, inverse transform and intra/interprediction processes. For example, the decoding apparatus may performprocesses opposite those of the aforementioned encoding method.Specifically, quantized transform coefficients may be obtained throughentropy decoding for a bitstream. A coefficient block of a currentblock, that is, transform coefficients, may be obtained through aninverse quantization process for the quantized transform coefficients. Aresidual block of the current block may be derived through an inversetransform for the transform coefficients. A reconstructed block of thecurrent block may be derived through the addition of a prediction blockof the current block, derived through an intra/inter prediction, and theresidual block.

Meanwhile, if an intra prediction is performed, a correlation betweensamples may be used, and a difference between the original block and aprediction block, that is, a residual, may be obtained. Theaforementioned transform and quantization may be applied to theresidual. Accordingly, spatial redundancy can be reduced. Hereinafter,an encoding method and a decoding method using an intra prediction arespecifically described.

An intra prediction refers to a prediction for generating predictionsamples for a current block based on reference samples outside thecurrent block within a picture (hereinafter a current picture) includingthe current block. In this case, the reference samples outside thecurrent block may refer to samples adjacent to the current block. If anintra prediction is applied to the current block, neighboring referencesamples to be used for the intra prediction of the current block may bederived.

For example, when the size (width×height) of a current block is nW×nH,neighboring reference samples of the current block may include a sampleneighboring the left boundary and a total of 2×nH samples neighboringthe bottom left of the current block, a sample neighboring the topboundary and a total of 2×nW samples neighboring the top right of thecurrent block, and one sample neighboring the left top of the currentblock. Alternatively, neighboring reference samples of a current blockmay also include a plurality of columns of top neighboring samples and aplurality of rows of left neighboring samples. Furthermore, neighboringreference samples of a current block may also include a total of nHsamples neighboring the right boundary of the current block having annW×nH size, a total of nW samples neighboring the bottom boundary of thecurrent block and one sample neighboring the bottom right of the currentblock.

In this case, some of the neighboring reference samples of the currentblock have not been decoded or may not be available. In this case, thedecoding apparatus may configure neighboring reference samples to beused for a prediction by substituting unavailable samples with availablesamples. Alternatively, neighboring reference samples to be used for aprediction may be constructed through the interpolation of availablesamples.

If neighboring reference samples are derived, (i) a prediction samplemay be derived based on an average or interpolation of the neighboringreference samples of a current block, and (ii) a prediction sample maybe derived based on a reference sample present in a specific(prediction) direction for the prediction sample among neighboringreference samples of a current block. (i) may be applied when an intraprediction mode is a non-directional mode or a non-angular mode. (ii)may be applied when an intra prediction mode is a directional mode or anangular mode.

Furthermore, a prediction sample may be generated through interpolationbetween a first neighboring sample, located in the prediction directionof an intra prediction mode of a current block, and a second neighboringsample corresponding to the first neighboring sample based on aprediction sample of the current block among neighboring referencesamples. The second neighboring sample may be a sample located in adirection opposite the prediction direction of the intra prediction modeof the current block. The above case may be called a linearinterpolation intra prediction (LIP). Furthermore, a temporaryprediction sample of a current block may be derived based on filteredneighboring reference samples. A prediction sample of the current blockmay be derived by weighted-summing at least one reference sample,derived based on an intra prediction mode, and the temporary predictionsample among the existing neighboring reference samples, that is,not-filtered neighboring reference samples. The above case may be calleda position dependent intra prediction (PDCP). Meanwhile, post-filteringfor the derived prediction sample may be performed, if necessary.

Specifically, an intra prediction procedure may include an intraprediction mode determination step, a neighboring reference samplederivation step, and an intra prediction mode-based prediction samplederivation step. Furthermore, a post-filtering step for a derivedprediction sample may be performed, if necessary.

FIG. 6 illustrates an example of a video encoding method based on anintra prediction and FIG. 7 schematically illustrates an intra predictorwithin the encoding apparatus. The intra predictor within the encodingapparatus in FIG. 7 may be applied to the intra predictor 222 of theencoding apparatus 200 in FIG. 2 identically or in a corresponding way.

Referring to FIGS. 6 and 7 , S600 may be performed by the intrapredictor 222 of the encoding apparatus. S610 may be performed by theresidual processor 230 of the encoding apparatus. Specifically, S610 maybe performed by the subtractor 231 of the encoding apparatus. At S620,prediction information may be derived by the intra predictor 222 and maybe encoded by the entropy encoder 240. At S620, residual information maybe derived by the residual processor 230 and may be encoded by theentropy encoder 240. The residual information is information related toresidual samples. The residual information may include informationrelated to quantized transform coefficients for the residual samples. Asdescribed above, the residual samples may be derived as transformcoefficients through the transformer 232 of the encoding apparatus. Thetransform coefficients may be derived as quantized transformcoefficients through the quantizer 233. Information related to thequantized transform coefficients may be encoded by the entropy encoder240 through a residual coding procedure.

The encoding apparatus may perform an intra prediction for a currentblock (S600). The encoding apparatus may derive an intra prediction modeof the current block, may derive neighboring reference samples of thecurrent block, and may generate prediction samples within the currentblock based on the intra prediction mode and the neighboring referencesamples. In this case, the intra prediction mode determination,neighboring reference sample derivation and prediction sample generationprocedures may be performed may be performed or any one procedure may beperformed prior to another procedure.

In one embodiment, the intra predictor 222 of the encoding apparatus mayinclude a prediction mode determiner 223, a reference sample deriver224, and a prediction sample deriver 225. The prediction mode determiner223 may determine an intra prediction mode for a current block. Thereference sample deriver 224 may derive neighboring reference samples ofthe current block. The prediction sample deriver 225 may deriveprediction samples of the current block. Meanwhile, although notillustrated, if a prediction sample filtering procedure to be describedlater is performed, the intra predictor 222 may further include aprediction sample filter unit (not illustrated). The encoding apparatusmay determine a mode applied to a current block among a plurality ofintra prediction modes. The encoding apparatus may compare RD costs forthe intra prediction modes, and may determine the best intra predictionmode of the current block.

As described above, the encoding apparatus may perform a predictionsample filtering procedure. The prediction sample filtering may becalled post filtering. Some or all of prediction samples may be filteredby the prediction sample filtering procedure. The prediction samplefiltering procedure may be omitted according to circumstances.

The encoding apparatus may generate residual samples for the currentblock based on (filtered) prediction samples (S610). The encodingapparatus may encode image information, including prediction modeinformation indicative of the intra prediction mode and residualinformation related to the residual samples (S620). The encoded imageinformation may be output in a bitstream form. The output bitstream maybe transmitted to the decoding apparatus through a storage medium over anetwork.

As described above, the encoding apparatus may generate a reconstructedpicture (including reconstructed samples and a reconstructed block)based on prediction samples and residual samples. This is for deriving,by the encoding apparatus, the same prediction results as thoseperformed in the decoding apparatus. The reason for this is that codingefficiency can be enhanced. Furthermore, as described above, an in-loopfiltering procedure may be further applied to the reconstructed picture.

FIG. 8 illustrates an example of a video coding method based on an intraprediction and FIG. 9 schematically illustrates an intra predictorwithin the decoding apparatus. An intra predictor within the decodingapparatus in FIG. 9 may be applied to the intra predictor 331 of thedecoding apparatus 300 in FIG. 3 identically or in a corresponding way.

Referring to FIGS. 8 and 9 , the decoding apparatus may performoperations corresponding to the operations performed in the encodingapparatus. The decoding apparatus may perform a prediction on a currentblock and derive prediction samples based on received predictioninformation.

S800 to S820 may be performed by the intra predictor 331 of the decodingapparatus. In S830, residual information may be obtained from abitstream by the entropy decoder 310 of the decoding apparatus. Theresidual processor 320 of the decoding apparatus may derive residualsamples for a current block based on the residual information.Specifically, the dequantizer 321 of the residual processor may derivetransform coefficients by performing inverse quantization based onquantized transform coefficients derived based on residual information.The inverse transformer 322 of the residual processor 320 may deriveresidual samples for the current block by performing an inversetransform for the transform coefficients. S840 may be performed by theadder 340 or reconstructor of the decoding apparatus.

The decoding apparatus may derive an intra prediction mode for a currentblock based on received prediction mode information (S800). The decodingapparatus may derive neighboring reference samples of the current block(S810). The decoding apparatus may generate prediction samples within acurrent block based on the intra prediction mode and the neighboringreference samples (S820). In this case, the decoding apparatus mayperform a prediction sample filtering procedure. The prediction samplefiltering may be called post filtering. Some or all of the predictionsamples may be filtered by the prediction sample filtering procedure.The prediction sample filtering procedure may be omitted according tocircumstances.

The decoding apparatus may generate residual samples for the currentblock based on the received residual information (S830). The decodingapparatus may generate reconstructed samples for the current block basedon (filtered) prediction samples and the residual samples, and maygenerate a reconstructed picture based on the reconstructed samples(S840).

In one embodiment, the intra predictor 331 of the decoding apparatus mayinclude a prediction mode determiner 333, a reference sample deriver334, and a prediction sample deriver 335. The prediction mode determiner333 may determine an intra prediction mode for a current block based onprediction mode information received from the prediction mode determiner223 of the encoding apparatus. The reference sample deriver 334 mayderive neighboring reference samples of the current block. Theprediction sample deriver 335 may derive prediction samples of thecurrent block. Meanwhile, although not illustrated, if the predictionsample filtering procedure is performed, the intra predictor 331 mayfurther include a prediction sample filter unit (not illustrated).

Meanwhile, in performing an intra prediction, prediction modeinformation may be determined depending on whether a most probable mode(MPM) is applied to a current block. For example, the prediction modeinformation may include flag information (e.g.,prev_intra_luma_pred_flag) indicating whether a most probable mode (MPM)is applied or a remaining mode is applied to a current block. If the MPMis applied to the current block, the prediction mode information mayfurther include index information (e.g., mpm_idx) indicative of one ofintra prediction mode candidates (MPM candidates). In this case, theintra prediction mode candidates (MPM candidates) may be constructed asan MPM candidate list or an MPM list. Furthermore, if the MPM is notapplied to the current block, the prediction mode information mayfurther include remaining mode information (e.g.,rem_inra_luma_pred_mode) indicative of one of the remaining intraprediction modes except intra prediction mode candidates (MPMcandidates). The decoding apparatus may determine an intra predictionmode of the current block based on the prediction mode information. Inthis case, the prediction mode information may be encoded/decodedthrough a coding method to be described later. For example, theprediction mode information may be encoded/decoded through entropycoding (e.g., CABAC, CAVLC) based on a truncated (rice) binary code.

Furthermore, if an intra prediction is applied, in determiningprediction mode information, an intra prediction mode applied to acurrent block may be determined using an intra prediction mode of aneighboring block. For example, the decoding apparatus may derive mostprobable mode (MPM) candidates based on an intra prediction mode of aleft block and intra prediction mode of a top block of a current block,and may select one of the MPM candidates based on an MPM index (e.g.,mpm_idx). Alternatively, the decoding apparatus may select one of theremaining intra prediction modes, not included in the MPM candidates,based on remaining intra prediction mode information (e.g.,rem_inra_luma_pred_mode). The MPM index may be signaled in the form ofan mpm_idx syntax element. The remaining intra prediction modeinformation may be signaled in the form of a rem_intra_luma_pred_modesyntax element. For example, the remaining intra prediction modeinformation may indicate one of the remaining intra prediction modeswhich are not included in the MPM candidates among all of intraprediction modes and which are indexed in order of a prediction modenumber.

An intra prediction mode may include non-directional (or non-angular)intra prediction modes and directional (or angular) intra predictionmodes. For example, in the HEVC standard, intra prediction modesincluding 2 non-directional prediction modes and 33 directionalprediction modes are used. The non-directional prediction modes mayinclude a planar intra prediction mode, that is, No. 0, and a DC intraprediction mode, that is, No. 1. The directional prediction modes mayinclude No. 2 to No. 34 intra prediction modes. The planar intraprediction mode may be called a planar mode, and the DC intra predictionmode may be called a DC mode.

Alternatively, in order to capture a given edge direction proposed innatural video, the directional intra prediction modes may be extendedfrom the existing 33 modes to 65 modes as in FIG. 10 . In this case, theintra prediction modes may include 2 non-directional intra predictionmodes and 65 directional intra prediction modes. The non-directionalintra prediction modes may include a planar intra prediction mode, thatis, No. 0, and a DC intra prediction mode, that is, No. 1. Thedirectional intra prediction modes may include Nos. 2 to 66 intraprediction modes. The extended directional intra prediction modes may beapplied to blocks having all sizes, and may be applied to both a lumacomponent and a chroma component. However, this is an example, andembodiments of this document may be applied to a case where the numberof intra prediction modes is different. A No. 67 intra prediction modeaccording to circumstances may be further used. The No. 67 intraprediction mode may indicate a linear model (LM) mode.

FIG. 10 illustrates 65 directional intra prediction modes.

Referring to FIG. 10 , modes may be divided into intra prediction modeshaving horizontal directionality and intra prediction modes havingvertical directionality based on a No. 34 intra prediction mode having atop left diagonal prediction direction. In FIG. 10 , H and V meanhorizontal directionality and vertical directionality, respectively.Each of numbers −32˜32 indicate displacement of a 1/32 unit on a samplegrid position. The Nos. 2 to 33 intra prediction modes have horizontaldirectionality, and the Nos. 34 to 66 intra prediction modes havevertical directionality. The No. 18 intra prediction mode and the No. 50intra prediction mode indicate a horizontal intra prediction mode and avertical intra prediction mode, respectively. The No. 2 intra predictionmode may be called a bottom left diagonal intra prediction mode, the No.34 intra prediction mode may be called a top left diagonal intraprediction mode, and the No. 66 intra prediction mode may be called atop right diagonal intra prediction mode.

As described above, in general, if block partitioning for a picture isperformed, a current block and a neighboring block to be coded havesimilar image characteristics. Accordingly, there is a good probabilitythat the current block and the neighboring block will have the same orsimilar intra prediction mode. According to such image characteristics,an intra prediction mode of a current block may be derived using anintra prediction mode of a neighboring block. This may be referred to asa most probable mode (MPM). That is, the MPM may mean a mode used toenhance coding efficiency by considering similarity between a currentblock and a neighboring block upon intra prediction mode coding.

For example, the encoding/decoding apparatus may configure a mostprobable mode (MPM) list for a current block. The MPM list may beindicated as an MPM candidate list. In this case, an MPM list includinggiven MPM candidates may be constructed by considering complexity ingenerating the MPM list. For example, an MPM list may include 3 MPMcandidates, 5 candidates or 6 MPM candidates. In one embodiment, an MPMlist may include MPM candidates derived based on an intra predictionmode of a neighboring block, a derived intra prediction mode and/or adefault intra prediction mode. In this case, in deriving MPM candidatesfrom the neighboring block, the encoding apparatus/decoding apparatusmay derive an intra prediction mode of the neighboring block bysearching neighboring blocks of a current block according to a specificorder, and may use the intra prediction mode of the neighboring block asan MPM candidate based on the derived order. For example, theneighboring blocks may include at least one of the left neighboringblock, top neighboring block, bottom left neighboring block, top rightneighboring block, and top-left neighboring block of the current block.If an intra prediction mode of the current block is not included amongthe MPM candidates within the MPM list, a remaining mode may be used. Inthis case, the remaining mode is a mode using the remaining intraprediction modes except the MPM candidates, among all of intraprediction modes, and may code and signal remaining intra predictionmode information. The remaining intra prediction mode information may beinformation indicative of an intra prediction mode applied to a currentblock, among the remaining intra prediction modes except the MPMcandidates. For example, if 67 intra prediction modes are used, theremaining intra prediction mode information may include a 6-bit syntaxelement (e.g., rem_intra_luma_pred_mode syntax element).

As described above, in the HEVC standard, 35 intra prediction modes areused upon intra prediction. In this case, an MPM list including 3 MPMcandidates is constructed. In this case, the 3 MPM candidates may bederived based on intra prediction modes of a neighboring block F andneighboring block G. Neighboring blocks of a current block including theneighboring block F and the neighboring block G may be the same as thosedescribed above.

FIG. 11 illustrates neighboring blocks of a current block.

Referring to FIG. 11 , neighboring blocks of a current block may includea neighboring block A, a neighboring block B, a neighboring block C, aneighboring block D, a neighboring block E, a neighboring block F and/ora neighboring block G.

In this case, the neighboring block A may indicate a neighboring blocklocated on the top left side of a top-left sample position of a currentblock. The neighboring block B may indicate a neighboring block locatedon the upper side of a top right sample position of the current block.The neighboring block C may indicate a neighboring block located on thetop right side of a top right sample position of the current block. Theneighboring block D may indicate a neighboring block located on the leftside of a bottom left sample position of the current block. Theneighboring block E may indicate a neighboring block located on thebottom left of a bottom left sample position of the current block. Theneighboring block G may indicate a neighboring block located on theupper side of a top-left sample position of the current block. Theneighboring block F may indicate a neighboring block located on the leftside of a top-left sample position of the current block.

For example, if the size of a current block is W×H and the x componentand y component of the top-left sample position of the current block are0, the neighboring block A may be a block including a sample at (−1, −1)coordinates, the neighboring block B may be a block including a sampleat (W−1, −1) coordinates, the neighboring block C may be a blockincluding a sample at (W, −1) coordinates, the neighboring block D maybe a block including a sample at (−1, H−1) coordinates, the neighboringblock E may be a block including a sample at (−1, H) coordinates, theneighboring block F may be a block including a sample at (−1, 0)coordinates, and the neighboring block G may be a block including asample at (0, −1) coordinates.

According to the HEVC standard, 3 MPM candidates may be derived based onan intra prediction mode of the neighboring block F and an intraprediction mode of the neighboring block G. For example, the intraprediction mode of the neighboring block F and the intra prediction modeof the neighboring block G may be derived. Meanwhile, in the followingcase, an intra prediction mode of the neighboring block F or an intraprediction mode of the neighboring block G may be derived as a DC intraprediction mode.

1) If the neighboring block F or the neighboring block G is notavailable

2) If the neighboring block F or the neighboring block G is not coded asan intra prediction mode (i.e., if the neighboring block F or theneighboring block G is not an intra coded block)

3) If the neighboring block F or the neighboring block G is out of acurrent coding tree unit (CTU)

If an intra prediction mode of the neighboring block F or an intraprediction mode of the neighboring block G is determined as describedabove, 3 MPM candidates may be derived like Table 1.

TABLE 1 if (intra mode of F and G are equal) {  if (intra mode of F <intra mode 2)  { MPM list1 }  else  { MPM list2 } } else {  if (Neitherintra mode of F nor G are intra mode Planar)  { MPM list3 }  else if(intra mode of (F+G) <intra mode 2)  { MPM list4 }  else  { MPM list5 }}

Table 1 illustrates a schematic algorithm (i.e., pseudo code) forconfiguring an MPM list. Referring to Table 1, whether the intraprediction mode of the neighboring block F and the intra prediction modeof the neighboring block G are equal may be determined.

If an intra prediction mode of the neighboring block F and an intraprediction mode of the neighboring block G are equal and the mode numberof an intra prediction mode of the neighboring block F is smaller than2, the MPM list of the current block may be derived as an MPM list 1(MPMlist1). That is, if an intra prediction mode of the neighboring block Fand an intra prediction mode of the neighboring block G are equal andthe intra prediction mode of the neighboring block F is the No. 0 intraprediction mode or the No. 1 intra prediction mode, the MPM list of thecurrent block may be derived as the MPM list 1. In this case, the MPMlist 1 may indicate an MPM list configured with MPM candidates {F, F−1,F+1}. F may indicate the intra prediction mode of the neighboring blockF. F−1 may indicate an intra prediction mode in which a value obtainedby subtracting 1 from the mode number of an intra prediction mode of theneighboring block F is a mode number. F+1 may indicate an intraprediction mode in which a value obtained by adding 1 to the mode numberof an intra prediction mode of the neighboring block F is a mode number.For example, if the intra prediction mode of the neighboring block F isthe No. N intra prediction mode, the MPM list 1 may be configured withan MPM list, including the No. N intra prediction mode, the No. N−1intra prediction mode, and the No. N+1 intra prediction mode as MPMcandidates.

Furthermore, if an intra prediction mode of the neighboring block F andan intra prediction mode of the neighboring block G are equal and themode number of an intra prediction mode of the neighboring block F isnot smaller than 2, the MPM list of the current block may be derived asan MPM list 2 (MPM list2).

Furthermore, if an intra prediction mode of the neighboring block F andan intra prediction mode of the neighboring block G are not equal andthe intra prediction mode of the neighboring block F and the intraprediction mode of the neighboring block G are not planar mode intraprediction modes, the MPM list of the current block may be derived as anMPM list 3 (MPM list3).

Furthermore, if an intra prediction mode of the neighboring block F andan intra prediction mode of the neighboring block G are not equal andthe sum of the mode number of an intra prediction mode of theneighboring block F and the mode number of an intra prediction mode ofthe neighboring block G is smaller than 2, the MPM list of the currentblock may be derived as an MPM list 4 (MPM list4).

Furthermore, if an intra prediction mode of the neighboring block F andan intra prediction mode of the neighboring block G are not equal and atleast one of the intra prediction mode of the neighboring block F andthe intra prediction mode of the neighboring block G is a planar modeintra prediction mode and the sum of the mode number of an intraprediction mode of the neighboring block F and the mode number of anintra prediction mode of the neighboring block G is not smaller than 2,the MPM list of the current block may be derived as an MPM list 5 (MPMlist5).

Meanwhile, as the number of intra prediction modes increases, the numberof MPM candidates needs to be increased. Accordingly, the number of MPMcandidates may be different depending on the number of intra predictionmodes. In general, when the number of intra prediction modes increases,the number of MPM candidates may increase. However, the number of MPMcandidates does not always increase when the number of intra predictionmodes increases. For example, if 35 intra prediction modes are presentor if 67 intra prediction modes are present, various numbers of MPMcandidates, such as 3, 4, 5, and 6, may be present depending on thedesign.

For example, a 6-MPM list configuration may be performed. That is, anMPM list including 6 MPM candidates may be constructed. For example, inthe 6-MPM list configuration, a process of searching for the locationsof various neighboring blocks and a consistent pruning check process forexcluding the same intra prediction mode may be performed. For example,the order in which 6 MPM candidates are constructed may be as follows:

The neighboring block D, the neighboring block B, the planar intraprediction mode, the DC intra prediction mode, the neighboring block E,the neighboring block C, and the neighboring block A.

That is, neighboring blocks may be derived as MPM candidate in order ofan intra prediction mode of the neighboring block D, an intra predictionmode of the neighboring block B, the planar intra prediction mode, theDC intra prediction mode, an intra prediction mode of the neighboringblock E, an intra prediction mode of the neighboring block C, and anintra prediction mode of the neighboring block A. If a prediction modeis the same as an already derived intra prediction mode, it may not bederived as an MPM candidate.

Furthermore, if an MPM list does not include an MPM candidate having amaximum number of candidates, that is, when the number of derived MPMcandidates is smaller than a maximum number of candidates, a directionalintra prediction mode neighboring a derived MPM candidate and apre-defined default intra prediction mode may be considered as MPMcandidates, and a pruning check process may be performed. In this case,the directional intra prediction mode neighboring the MPM candidate mayindicate an intra prediction mode having a mode number neighboring thatof the MPM candidate. The neighboring block search and the consistentpruning check have an advantage in the reduction of a bit transfer rate,but may increase the number of hardware operation cycles for the MPMlist configuration of each block. The worst scenario is that a 3840×21604K image may be partitioned into 4×4 size blocks for an intraprediction. In this case, an increased hardware operation cycle for eachof the 4×4 size blocks may be importantly considered in throughput.Meanwhile, if a neighboring block coded through an inter prediction isaware of an intra prediction mode of the neighboring block, the intraprediction mode of the neighboring block may be used for an MPM listconfiguration.

As described above, in configuring an MPM list, the encoding apparatusmay determine the best intra prediction mode by optimizing the bit rateand distortion at the same time, and may code the determined best intraprediction mode as a bitstream. The decoding apparatus may parse(decode) the intra prediction mode included in the bitstream, and mayperform an intra prediction based on the parsed intra prediction mode.However, in order to minimize signaling overhead as the number of intraprediction modes increases, efficient intra mode coding is necessary.Both the encoding apparatus and the decoding apparatus configure MPMlists using neighboring intra prediction modes of coded blocks. In thiscase, when the best intra prediction mode is one of candidates withinthe MPM list, overhead can be minimized by signaling an MPM index. Thelength of the MPM list and the method of configuring the MPM list may bedifferent depending on an algorithm.

In this case, if the 67 intra prediction modes are used for an intraprediction, the MPM list including the existing 3 MPM candidates may notbe sufficient to show the diversity of multiple intra prediction modes.Furthermore, a 6-MPM list configuration scheme including neighboringblock search and a pruning check process may affect throughput becauseit is too complicated. Accordingly, embodiments of this document proposeefficient the MPM list configuration method having a proper balancebetween complexity and coding efficiency.

FIGS. 12 and 13 are flowcharts schematically illustrating a method ofconfiguring an MPM list for a current block.

Referring to FIGS. 12 and 13 , an MPM list for a current block includingk MPM candidates may be constructed. In this case, k may indicate thelength of the MPM list, that is, the number of MPM candidates includedin the MPM list. According to the embodiments disclosed in FIGS. 12 and13 , 5 efficient MPM lists (MPM list 1˜MPM list 5) may be constructedbased on five conditions. That is, one of the 5 MPM lists may be derivedas an MPM list for the current block based on the five conditions. TheMPM lists may be independent lists as illustrated in FIG. 12 , and maybe lists having partially shared portions as illustrated in FIG. 13 . Ifa partial list shared as in FIG. 13 is used, a duplication process canbe avoided. The conditions 5 may be modeled so that the sum of theprobabilities of all the conditions become 1.

FIG. 14 is a flowchart illustrating an embodiment of a method ofconfiguring an MPM list for a current block.

FIG. 14 illustrates a method of efficiently configuring an MPM list fora current block including k MPM candidates based on a neighboring blockadjacent to the current block. For example, k may be 6, and fiveconditions may be used in order to configure an MPM list for the currentblock among 5 efficient lists. In FIG. 14 , L may indicate an intraprediction mode of the neighboring block B illustrated in FIG. 11 , andA may indicate an intra prediction mode of the neighboring block Dillustrated in FIG. 11 . Alternatively, in contrast, L may indicate anintra prediction mode of the neighboring block D illustrated in FIG. 11, and A may indicate an intra prediction mode of the neighboring block Billustrated in FIG. 11 . In FIG. 14 , a symbol “!” is a negative logicoperator, and may refer to an operator “not” that converts a value thatis not true into a true value and the vice versa. For example, !7 mayindicate a value 0, and !0 may indicate a value 1.

Referring to FIG. 14 , the encoding/decoding apparatus may check acondition 1 for determining whether L and A are equal (S1400). That is,the encoding/decoding apparatus may determine whether L and A are thesame intra prediction mode. The condition 1 may be a condition fordetermining whether “L==A”.

If L and A are the same intra prediction mode (i.e., when the condition1 is satisfied), the encoding/decoding apparatus may check a condition 2for determining whether L (or A) is a directional intra prediction mode(S1405). That is, the encoding/decoding apparatus may determine whetherL and A are equal and the mode number of L (or A) is greater than themode number of a DC mode. The condition 2 may be a condition fordetermining whether “L>DC_idx”.

When the condition 2 is satisfied, the encoding/decoding apparatus mayderive an MPM list 1 as an MPM list for the current block (S1410). Whenthe condition 2 is not satisfied, the encoding/decoding apparatus mayderive an MPM list 2 as an MPM list for the current block (S1415).

In this case, the MPM list 1 may be constructed like Table 2, and theMPM list 2 may be constructed like Table 3.

TABLE 2 mpm[0] = L mpm[2] = Planar_idx mpm[3] = DC_idx mpm[3] = L−1mpm[4] = L+1 mpm[5] = L−2

TABLE 3 mpm[0] = L mpm[1] = ! L mpm[2] = Vertical_idx mpm[3] =Horizontal_idx mpm[4] = Vertical_idx−4 mpm[5] = Vertical_idx+4

Referring to Table 2 and Table 3, the MPM list 1 may include a first MPMcandidate (mpm[0]) to a sixth MPM candidate (mpm[5]) as in Table 2, TheMPM list 2 may include a first MPM candidate (mpm[0]) to a sixth MPMcandidate (mpm[5]) as in Table 3. In this case, the first to sixth MPMcandidates may indicate intra prediction modes (i.e., mode numbers)indicated by respective MPM index values 0 to 5. For example, the firstMPM candidate indicates an intra prediction mode assigned to mpm[0], andmay be indicated the value 0 of an MPM index.

If L and A are not the same intra prediction mode (i.e., when thecondition 1 is not satisfied), the encoding/decoding apparatus mayderive a partially shared MPM list 1 (S1420).

In this case, the partially shared MPM list 1 may be constructed likeTable 4.

TABLE 4 mpm[0] = L mpm[1] = A If L>A, max_idx is 0 and min_idx is 1.Otherwise, max_idx is 1 and min_idx is 0.

Referring to Table 4, the partially shared MPM list 1 may include afirst MPM candidate (mpm[0]) indicative of L and a second MPM candidate(mpm[1]) indicative of A. That is, if L and A are not equal, theencoding/decoding apparatus may first add L and A to the MPM list.Accordingly, MPM lists 3, 4, and 5 to be described later may beconstructed to partially include the first MPM candidate (mpm[0]) andthe second MPM candidate (mpm[1]) as in Table 4. In this case, inderiving the first MPM candidate (mpm[0]) and the second MPM candidate(mpm[1]), an MPM index order may be determined by comparing the sizes ofthe mode numbers of L and A. For example, referring to Table 4, when Lhas a greater mode number than A, a max_idx value indicative of L may beset to 0, and a min_idx value indicative of A may be set to 1. When Lhas a smaller mode number than A, max_idx and min_idx values may beinversely set.

Next, the encoding/decoding apparatus may check a condition 3 fordetermining whether both L and A are directional intra prediction modes(S1425). That is, the encoding/decoding apparatus may determine whetherL and A are not equal and the mode number of each of L and A is greaterthan a DC mode number. The condition 3 may be a condition fordetermining whether “L>DC_idx AND A>DC_idx”.

If each of L and A has a greater mode number than the DC mode (i.e.,when the condition 3 is satisfied), the encoding/decoding apparatus mayderive a partially shared MPM list 2 (S1440).

In this case, the partially shared MPM list 2 may be constructed likeTable 5.

TABLE 5 mpm[2] = Planar_idx mpm[3] = DC_idxdiff=mpm[max_idx]−mpm[min_idx]

Referring to Table 5, the partially shared MPM list 2 may include athird MPM candidate (mpm[2]) indicative of a planar mode and a fourthMPM candidate (mpm[3]) indicative of a DC mode. That is, if thecondition 3 is satisfied, this means that both L and A are directionalintra prediction modes. Accordingly, the encoding/decoding apparatus mayadd the planar mode and the DC mode, that is, not directional intraprediction modes, to the MPM list as the third MPM candidate (mpm[2])and the fourth MPM candidate (mpm[3]) after the first MPM candidate(mpm[0]=L) and the second MPM candidate (mpm[1]=A) included in thepartially shared MPM list 1 described in Table 4. Accordingly, MPM lists4 and 5 to be described later may be constructed to partially includethe third MPM candidate (mpm[2]) and the fourth MPM candidate (mpm[3])in Table 5 along with the first MPM candidate (mpm[0]) and the secondMPM candidate (mpm[1]) in Table 4.

Next, the encoding/decoding apparatus may check a condition 4 fordetermining whether a difference between the mode number of L and themode number of A is not 64 and not 1 (S1445). The condition 4 may be acondition for determining whether “diff !=64 AND diff !=1”.

For example, the difference (diff) between the mode number of L and themode number of A may be calculated like an equation illustrated in Table5. In this case, diff may be a result obtained by subtracting a smallervalue from a greater value in the mode number of L and the mode numberof A.

In this case, when the condition 4 is satisfied, the encoding/decodingapparatus may derive an MPM list 5 as an MPM list for the current block(S1455). When the condition 4 is not satisfied, the encoding/decodingapparatus may derive an MPM list 4 as an MPM list for the current block(S1450).

In this case, the MPM list 4 may be constructed like Table 6, and theMPM list 5 may be constructed like Table 7.

TABLE 6 mpm[4] = mpm[max_idx]−2 mpm[5] = mpm[max_idx]+2

TABLE 7 mpm[4] = mpm[max_idx]−1 mpm[5] = mpm[max_idx]+1

Each of the MPM list 4 of Table 6 and the MPM list 5 of Table 7 may beconstructed to include a fifth MPM candidate (mpm[4]) and a sixth MPMcandidate (mpm[5]) along with the first to fourth MPM candidates(mpm[0]— mpm[3]) described in Table 4 and Table 5.

Meanwhile, if at least one of L and A is a non-directional intraprediction mode at step S1425 (i.e., when the condition 3 is notsatisfied), the encoding/decoding apparatus may check a condition 5 fordetermining whether only any one of L and A is a non-directional intraprediction mode (S1430). That is, the encoding/decoding apparatus maydetermine whether at least one of L and A is a DC mode number or lessand the sum of the mode number of L and the mode number of A is 2 ormore. The condition 5 may be a condition for determining whether“L+A>=2”.

When the sum of the mode number of L and the mode number of A is 2 ormore (i.e., when the condition 5 is satisfied), the encoding/decodingapparatus may derive an MPM list 3 as an MPM list for the current block(S1435).

In this case, the MPM list 3 may be constructed like Table 8.

TABLE 8 mpm[2] = ! mpm[min_idx] mpm[3] = mpm[max_idx]−1 mpm[4] =mpm[max_idx]+1 mpm[5] = mpm[max_idx]−2

Referring to Table 8, the MPM list 3 may be constructed to include thirdto sixth MPM candidates (mpm[2]˜mpm[5]) along with the first MPMcandidate (mpm[0]) and the second MPM candidate (mpm[1]) described inTable 4. In this case, to satisfy the condition 5 may mean that any oneof L and A is a directional prediction mode and the other is anon-directional prediction mode. Accordingly, the MPM list 3 may includea non-directional prediction mode as the third MPM candidate (mpm[2])after the first and second MPM candidates. For example, if one having anon-directional mode, among L and A, is a planar mode, the third MPMcandidate (mpm[2]) may be derived as a DC mode. Alternatively, if onehaving a non-directional mode, among L and A, is a DC mode, the thirdMPM candidate (mpm[2]) may be derived as a planar mode.

When the sum of the mode number of L and the mode number of A is not 2or more (i.e., when the condition 5 is not satisfied), theencoding/decoding apparatus may derive an MPM list 2 as an MPM list forthe current block (S1415). In this case, both L and A may benon-directional prediction modes.

In this case, the MPM list 2 may be the same as Table 3. Referring toTable 3, since both L and A are non-directional prediction modes, in theMPM list 2, a planar mode and a DC mode may be derived as the first MPMcandidate (mpm[0]) and the second MPM candidate (mpm[1]), respectively.The remaining third to sixth MPM candidates (mpm[2]˜mpm[5]) may bederived as illustrated in Table 3.

In Table 2 to Table 8, in (directional intra prediction mode+1),(directional intra prediction mode−1), (directional intra predictionmode+2), (directional intra prediction mode−2), etc., a value may bemathematically added or subtracted. However, in some cases, mathematicalcalculation may not be simply performed. For example, in anon-directional intra prediction mode, the consistency of a neighboringintra prediction mode may not be maintained by subtracting or adding adirectional intra prediction mode or a maximum available intraprediction mode index may be exceeded. For example, a value obtained bysubtracting 1 from a directional intra prediction mode may be derived asan intra mode 1 indicative of a DC index (DC mode). 67 is obtained byadding 1 to the No. 66 directional intra prediction mode, and thus itexceeds the index 66 of a maximum available intra mode. Accordingly, anoperation of adding or subtracting a mode may be limited as followsusing a modular arithmetic (indicated by %). That is, a value indicativeof a non-directional intra prediction mode that does not consistency ora value that exceeds a maximum available intra mode index can beprevented from being derived. For example, the adding or subtracting ofa mode using the modular arithmetic may be derived like Table 9.

TABLE 9 - Intra mode −1 : (Intra mode + 62) % 65 + 2 - Intra mode +1 :(Intra mode − 1) % 65 + 2 - Intra mode −2 : (Intra mode + 61) % 65 + 2

The method of configuring an MPM list in the aforementioned embodimentsmay be performed in the encoding/decoding apparatus. In this case, inconfiguring the MPM list, the encoding apparatus may derive the bestintra prediction mode to be applied to a current block, and maydetermine whether the derived best intra prediction mode belongs to anMPM list including MPM candidates constructed using a method, such asthose of the aforementioned embodiments. If an intra prediction mode ofa current block belongs to an MPM list including MPM candidates, theencoding apparatus may encode an MPM flag and an MPM index. In thiscase, the MPM flag may indicate whether the intra prediction mode of thecurrent block belongs to the MPM list (i.e., MPM candidates). The MPMindex may indicate whether which MPM mode is applied as the intraprediction mode of the current block, among the MPM candidates includedin the MPM list. In contrast, if the intra prediction mode of thecurrent block does not belong to the MPM list including the MPMcandidates, the encoding apparatus may encode the intra prediction modeof the current block.

The decoding apparatus may configure an MPM list by applying the samemethod as that of the aforementioned embodiments identically with theencoding apparatus. Furthermore, the decoding apparatus may receive anMPM flag from the encoding apparatus, and may identify whether an intraprediction mode applied to a current block is included in an MPM list(i.e., MPM candidates) using the MPM flag. If the intra prediction modeapplied to the current block is included within the MPM list (i.e., MPMcandidates), the decoding apparatus may derive an intra prediction modeapplied to the current block using an MPM index received from theencoding apparatus. In contrast, if the intra prediction mode applied tothe current block is not included in the MPM list (i.e., MPMcandidates), the decoding apparatus may derive an intra prediction modeapplied to the current block using a prediction mode index (or,remaining prediction mode index; remaining mode information) indicativeof a specific prediction mode, among remaining prediction modes exceptthe MPM candidates.

Hereinafter, there is proposed a method of configuring an extended MPMlist having similar complexity by comparing the extended MPM list withan MPM list including 3 MPM candidates. The extended MPM list refers toa MPM list including three or more MPM candidates, and may include 3, 4,5 or 6 MPM candidates, for example. In a proposed method to be describedlater, an embodiment in which an MPM list including 6 MPM candidates isgenerated using two neighboring intra prediction modes (left neighboringintra prediction mode and above neighboring intra prediction mode). Inthis case, the left neighboring intra prediction mode (LEFT) mayindicate an intra prediction mode of the neighboring block D in FIG. 11, and the above neighboring intra prediction mode (ABOVE) may indicatean intra prediction mode of the neighboring block B in FIG. 11 .

In configuring the extended MPM list, the reason for the 3 MPMcandidates are used is that there are advantages in simplicity andthroughput. However, complexity may be increased because the existingmethod using 6 MPM candidates includes a process of searching for thelocations of various neighboring blocks, a continuous pruning process,steps for generating the MPM list, line buffer requirements and parsingdependency. Accordingly, as in the method using 3 MPM candidates, thereis proposed a method capable of obtaining advantages in complexity andthroughput even in using 6 MPM candidates.

In one embodiment, an MPM list may be constructed based on an algorithm(i.e., pseudo code), such as Table 10.

TABLE 10 Determine LEFT and ABOVE intra modes Set MPM as MPM_ordering_0If (LEFT==ABOVE)  If (LEFT>=DC_idx), then set MPM as MPM_ordering_1 Elseif (LEFT>DC_idx and ABOVE>DC_idx), then set MPM as MPM_ordering_2  Elseif (LEFT+ABOVE> DC_idx), then set MPM as  MPM_ordering_3

Referring to Table 10, the MPM list of a current block may be generatedbased on LEFT and ABOVE, that is, neighboring intra prediction modes. Inthis case, LEFT may indicate an intra prediction mode of the neighboringblock D in FIG. 11 , and ABOVE may indicate an intra prediction mode ofthe neighboring block B in FIG. 11 . Furthermore, the neighboring blockD may indicate a left neighboring block located on the downmost side,among left neighboring blocks neighboring the left of the current block.The neighboring block B may indicate a top neighboring block located onthe far right side, among neighboring blocks neighboring the top of thecurrent block.

Specifically, intra prediction modes of LEFT and ABOVE may be derived.Furthermore, the MPM list (i.e., MPM candidates) of a current block maybe set as MPM_ordering_0 based on the intra prediction modes of LEFT andABOVE. In this case, if LEFT and ABOVE are equal and the mode number ofLEFT is greater than or equal to a DC mode, the MPM list (i.e., MPMcandidates) of the current block may be set as MPM_ordering_1.Alternatively, if LEFT and ABOVE are not equal and the mode number ofLEFT is greater than that of a DC mode and the mode number of ABOVE isgreater than that of a DC mode, the MPM list (i.e., MPM candidates) ofthe current block may be set as MPM_ordering_2. Alternatively, if LEFTand ABOVE are not equal, at least one of the mode number of LEFT and themode number of ABOVE is not greater than that of a DC mode, and the sumof the mode number of LEFT and the mode number of ABOVE is greater thanthe mode number of a DC mode, the MPM list (i.e., MPM candidates) of thecurrent block may be set as MPM_ordering_3.

In this case, MPM_ordering_0, MPM_ordering_1, MPM_ordering_2, orMPM_ordering_3 may have been constructed to include MPM candidatesaccording to a predetermined order as described in FIGS. 12 to 14 .

Furthermore, if one of the remaining intra prediction modes exceptderived MPM candidates is an intra prediction mode applied to a currentblock as described above, the MPM coding of the current block may beperformed based on remaining mode information. Such remaining modeinformation may be encoded/decoded by applying truncated binary (TB)coding.

In another embodiment, an MPM list may be constructed based on analgorithm (i.e., spec), such as Table 11.

TABLE 11 Derivation process for luma intra prediction mode Input to thisprocess are: - a luma location ( xCb , yCb ) specifying the top-leftsample of the current luma coding block relative to the top-left lumasample of the current picture, - a variable cbWidth specifying the widthof the current coding block in luma samples, - a variable cbHeightspecifying the height of the current coding block in luma samples. Inthis process, the luma intra prediction mode IntraPredModeY[ xCb ][ yCb] is derived. Table 2.3-1 specifies the value for the intra predictionmode IntraPredModeY[ xCb ][ yCb ] and the associated  names. Table2.3-2 - Specification of intra prediction mode and associated namesIntra prediction mode Associated name 0 INTRA_PLANAR 1 INTRA_DC 2 . . .66 INTRA_ANGULAR2 . . . INTRA_ANGULAR66 77  INTRA_CCLM  NOTE - : Theintra prediction mode INTRA_CCLM is only applicable to chromacomponents. IntraPredModeY[ xCb ][ yCb ] is derived by the followingordered steps:   1.  The neighbouring locations ( xNbA, yNbA) and (xNbB, yNbB ) are set equal to ( xCb − 1, yCb+  cbHeight − 1 ) and ( xCb+cbWidth − 1, yCb − 1 ), respectively.   2.  For X being replaced byeither A or B, the variables candIntraPredModeX are derived as follows: - The availability derivation process for a block as specified inclause 6.4.X [Ed. (BB): Neighbouring blocks availability checkingprocess tbd] is invoked with the location ( xCurr, yCurr ) set equal to( xCb, yCb ) and the neighbouring location ( xNbY, yNbY ) set equal to (xNbX, yNbX ) as inputs, and the output is assigned to availableX.  - Thecandidate intra prediction mode candIntraPredModeX is derived asfollows:  -If one or more of the following conditions are true,candIntraPredModeX is set equal to INTRA_PLANAR. - The variableavailableX is equal to FALSE. - CuPredMode[ xNbX ][ yNbX ] is not equalto MODE_INTRA. - X is equal to B and yCb − 1 is less than ( ( yCb >>CtbLog2SizeY ) << CtbLog2SizeY ).  -Otherwise, candIntraPredModeX is setequal to IntraPredModeY[ xNbX ][ yNbX ].   3.  The candModeList[ x ]with x = 0..5 is derived as follows:  -  candModeList[ 0 ] =candIntraPredModeA   (8-1)   candModeList[ 1 ] = ! candIntraPredModeA  (8-2)   candModeList[ 2 ] = INTRA_ANGULAR50   (8-3)   candModeList[ 3] = INTRA_ANGULAR18   (8-4)   candModeList[ 4 ] = INTRA_ANGULAR46  (8-5)   candModeList[ 5 ] = INTRA_ANGULAR54   (8-6)  -  IfcandIntraPredModeB is equal to candIntraPredModeA, the followingapplies: -If candlntraPredModeA is larger than 1, candModeList[ x ] withx = 0..5 is derived as follows: candModeList[ 0 ] = candIntraPredModeA (8-7) candModeList[ 1 ] = INTRA_PLANAR  (8-8) candModeList[ 2 ] =INTRA_DC  (8-9) candModeList[ 3 ] = 2 + ( ( candIntraPredModeA + 62 ) %65 )  (8-10) candModel.ist| 4 ] = 2 + ( ( candIntraPredModeA − 1 ) % 65) (8-11) candModcList[ 5 ] = 2 + ( ( candIntraPredModeA + 61 ) % 65 ) (8-12) - Otherwise (candIntraPredModeB is not equal tocandIntraPredModeA), the following applies: -candModeList[ 0 ] andcandModeList[ 1 ] are derived as follows: candModeList[ 0 ] =candIntraPredModeA  (8-13) candModeList[ 1 ] = candIntraPredModeB (8-14) -Set the variable biggerIdx is as follows biggerIdx =candModeList[ 0 ] > candModeList[ 1 ] ? 0 : 1 (8-15) -If both ofcandIntraPredModeA and candIntraPredModeB are larger than 1,candModeList[ x ] with x = 2..5 is derived as follows: candModeList[ 2 ]= INTRA_PLANAR (8-16) candModeList[ 3 ] = INTRA_DC  (8-17) - IfcandModeList[biggerIdx] − candModeList[ !biggerIdx] is equal to neither64 nor 1, the following applies:  candModeList[ 4 ] = 2 + ( (candModeList[biggerIdx] + 62 ) % 65 )  (8-18)  candModeList[ 5 ] = 2 + (( candModeList[biggerIdx] − 1 ) % 65 )  (8-19)  - Otherwise, thefollowing applies:  candModeList[ 4 ] = 2 + ( (candModeList[biggerIdx] + 61 ) % 65 )  (8-20)  candModeList[ 5 ] = 2 + (candModeList[biggerIdx] % 65 )  (8-21) -Otherwise, if sum ofcandIntraPredModeA and candIntraPredModeB is larger or equal to 2, thefollowing applies:  candModeList[ 2 ] = ! candModeList[ ! biggerIdx] (8-22)  candModeList[ 3 ] = 2 + ( ( candModeList[biggerIdx] + 62 ) % 65)  (8-23)  candModeList[ 4 ] = 2 + ( ( candModeList[biggerIdx] − 1 ) %65 )  (8-24)  candModeList[ 5 ] = 2 + ( ( candModeList[biggerIdx] + 61 )% 65 )  (8-25)   4. IntraPredModeY[ xCb ][ yCb ] is derived by applyingthe following procedure: - If intra_luma_mpm_flag[ xCb ][ yCb ] is equalto 1, the IntraPredModeY[ xCb ][ yCb ] is set  equal to candModeList[intra_luma_mpm_idx[ xCb ][ yCb ] ]. - Otherwise, IntraPredModeY[ xCb ][yCb ] is derived by applying the following ordered steps:  1. The arraycandModeList [ x ], x = 0..5 is modified by the following ordered steps:  i.  For i sequentially equals to 0 to 4, inclusive, apply:   ii. For jsequentially equals to i + 1 to 5, inclusive, compare candModeList[ i ]to  candModeList[ j ], When candModeList[ i ] is greater thancandModeList[ j ], both  values are swapped as follows:  ( candModeList[i ], candModeList[ j ] ) = Swap( candModeList[ i ],  candModeList[ j]) (8-26)   2.  IntraPredModeY[ xCb ][ yCb ] is derived by the followingordered steps: i. IntraPredModeY[ xCb ][ yCb ] is set equal to intra_luma_mpm_remainder[ xCb ][ yCb ].   ii. For i equal to 0 to 5,inclusive, when IntraPredModeY[ xCb ][ yCb ] is greater than or  equalto candModeList[ i ], the value of IntraPredModeY[ xCb ][ yCb ] is incremented by one. The variable IntraPredModeY[ x ][ y ] with x =xCb..xCb + cbWidth − 1 and y = yCb..yCb + cbHeight − 1 is set to beequal to IntraPredModeY[ xCb ][ yCb ].

Referring to Table 11, candidate intra prediction modes may be derivedbased on a neighboring block of a current block. An MPM list for thecurrent block may be constructed based on the candidate intra predictionmodes. The candidate intra prediction modes may include a candidateintra prediction mode A and a candidate intra prediction mode B.

For example, when at least one of conditions to be described later istrue (i.e., when at least one of conditions to be described later issatisfied, the candidate intra prediction mode A may be set as a planarmode intra prediction mode.

-   -   A neighboring block A is not available    -   An intra prediction is not applied to the neighboring block A

In this case, the neighboring block A may be a left neighboring block ofa current block. The left neighboring block may be a left neighboringblock located on the downmost side, among left neighboring blocksneighboring the current block. For example, if the size of a currentblock is cbWidth×cbHeight and an x component and y component at thetop-left sample position of the current block are xCb and yCb, theneighboring block A may be a block including a sample at (xCb−1,yCb+cbHeight−1) coordinates. Meanwhile, the neighboring block A mayindicate the neighboring block D of FIG. 11 .

When all the conditions are not true (i.e., when all the conditions arenot satisfied), the candidate intra prediction mode A may be set as anintra prediction mode of the neighboring block A.

Furthermore, for example, when at least one of conditions to bedescribed later is true (i.e., when at least one of the conditions to bedescribed later is satisfied, the candidate intra prediction mode B maybe set as a planar mode intra prediction mode.

-   -   A neighboring block B is not available    -   An intra prediction is not applied to the neighboring block B    -   yCb−1 is smaller than ((yCb>>CtbLog2SizeY)<<CtbLog2SizeY)

In this case, the neighboring block B may be a top neighboring block ofthe current block. The top neighboring block may be a top neighboringblock located on the far right side among top neighboring blocksneighboring the current block. For example, if the size of a currentblock is cbWidth×cbHeight and an x component and y component at thetop-left sample position of the current block are xCb and yCb, theneighboring block B may be a block including a sample at (xCb+cbWidth−1,yCb−1) coordinates. Meanwhile, CtbLog2SizeY may indicate the size of acurrent CTU, and ((yCb>>CtbLog2SizeY)<<CtbLog2SizeY) may indicatecoordinates at the top boundary of the current CTU. That is, a casewhere yCb−1 is smaller than ((yCb>>CtbLog2SizeY)<<CtbLog2SizeY) mayindicate a case where the neighboring block B is out of the range of thecurrent CTU. That is, the aforementioned condition may indicate a casewhere the neighboring block B is out of the range of the current CTU.

When all the conditions are not true (i.e., when all the conditions arenot satisfied), the candidate intra prediction mode B may be set as anintra prediction mode of the neighboring block B.

If candidate intra prediction modes have been derived, the MPM list ofthe current block may be constructed like a first MPM list. The firstMPM list may be configured with a first MPM candidate indicative of acandidate intra prediction mode A, a second MPM candidate indicative ofthe intra prediction mode of a value obtained by performing an operationon the candidate intra prediction mode A using a negative logicoperator, a third MPM candidate indicative of the No. 50 intraprediction mode, a fourth MPM candidate indicative of the No. 18 intraprediction mode, a fifth MPM candidate indicative of the No. 46 intraprediction mode, and a sixth MPM candidate indicative of the No. 54intra prediction mode.

Thereafter, whether the candidate intra prediction mode B and thecandidate intra prediction mode A are equal may be determined.

In this case, if the candidate intra prediction mode B and the candidateintra prediction mode A are equal, whether the candidate intraprediction mode A is larger than 1 may be determined. When the candidateintra prediction mode A is larger than 1, the MPM list of the currentblock may be configured like a second MPM list. The second MPM list maybe configured with a first MPM candidate indicative of the candidateintra prediction mode A, a second MPM candidate indicative of a planarmode intra prediction mode, a third MPM candidate indicative of a DCintra prediction mode, a fourth MPM candidate indicative of an intraprediction mode derived as 2+((candIntraPredModeA+62) % 65), a fifth MPMcandidate indicative of an intra prediction mode derived as2+((candIntraPredModeA—1) % 65), and a sixth MPM candidate indicative ofan intra prediction mode derived as 2+((candIntraPredModeA+61) % 65).

Otherwise, if the candidate intra prediction mode B and the candidateintra prediction mode A are not equal, first, the first MPM candidateand second MPM candidate of the current block may be derived. The firstMPM candidate may be derived as the candidate intra prediction mode A,and the second MPM candidate may be derived as the candidate intraprediction mode B. Furthermore, biggerIdx may be set. When the first MPMcandidate is greater than the second MPM candidate, biggerIdx may bederived as 0. When the first MPM candidate is not greater than thesecond MPM candidate, biggerIdx may be derived as 1.

Next, whether the candidate intra prediction mode A and the candidateintra prediction mode B are larger than 1 may be determined (i.e.,whether the mode number of the candidate intra prediction mode A and themode number of the candidate intra prediction mode B are larger than 1may be determined). In this case, when the candidate intra predictionmode A and the candidate intra prediction mode B are larger than 1, thethird MPM candidate and fourth MPM candidate of the current block may bederived. The third MPM candidate may be derived as a planar mode intraprediction mode, and the fourth MPM candidate may be derived as a DCintra prediction mode.

Next, whether a difference(diff) between an MPM candidate indicated byan MPM index having a value of biggerIdx and an MPM candidate indicatedby an MPM index having a value (i.e., !biggerIdx) obtained by performingan operation on biggerIdx using a negative logic operator is not 64 andalso not 1 may be determined.

When the difference is not 64 and also not 1, the fifth MPM candidateand sixth MPM candidate of the current block may be derived. The fifthMPM candidate may be derived as an intra prediction mode derived as2+((candModeList[biggerIdx]+62) % 65). The sixth MPM candidate may bederived as an intra prediction mode derived as2+((candModeList[biggerIdx]−1) % 65).

Otherwise, if the difference is 64 or 1, the fifth MPM candidate andsixth MPM candidate of the current block may be derived. The fifth MPMcandidate may be derived as an intra prediction mode derived as2+((candModeList[biggerIdx]+61) % 65). The sixth MPM candidate may bederived as an intra prediction mode derived as2+(candModeList[biggerIdx]% 65).

Meanwhile, when the sum of the candidate intra prediction mode A and thecandidate intra prediction mode B is greater than or equal to 2, thethird MPM candidate, fourth MPM candidate, fifth MPM candidate and sixthMPM candidate of the current block may be derived. The third MPMcandidate may be derived as an intra prediction mode derived as a valueobtained by performing an operation on an MPM candidate, indicated by anMPM index having a value (i.e., !biggerIdx) by performing an operationon biggerIdx using a negative logic operator, using a negative logicoperator. The fourth MPM candidate may be derived as an intra predictionmode derived as 2+((candModeList[biggerIdx]+62) % 65). The fifth MPMcandidate may be derived as an intra prediction mode derived as2+((candModeList[biggerIdx]−1) % 65). The sixth MPM candidate may bederived as an intra prediction mode derived as2+((candModeList[biggerIdx]+61) % 65).

As described above, an intra prediction mode for a current block may bederived based on an MPM list including derived MPM candidates. Predictedsamples may be generated by performing a prediction on the current blockbased on the derived intra prediction mode.

In this case, in deriving the intra prediction mode of the currentblock, when the MPM flag (e.g., intra_luma_mpm_flag in Table 11) is 1,as described above, an MPM candidate indicated by an MPM index (e.g.,intra_luma_mpm_idx in Table 11) among the derived MPM candidates may bederived as the intra prediction mode of the current block.Alternatively, when the MPM flag (e.g., intra_luma_mpm_flag in Table 11)is 0, as described above, a remaining mode (e.g.,intra_luma_mpm_remainder in Table 11) indicating one of the remainingintra prediction modes except the derived MPM candidates may be derivedas the intra prediction mode of the current block.

As described above, intra prediction mode information for a currentblock may be coded and signaled as a value of a syntax element. In thiscase, the intra prediction mode information is information necessary forthe intra prediction of the current block, and may include theaforementioned MPM flag, MPM index, remaining mode, etc. In coding theintra prediction mode information, various binarization processes may beapplied based on each syntax element.

In this case, the binarization may mean a set of bin strings for all thepossible values of the syntax elements. Furthermore, the binarizationprocess may mean a procedure for uniquely mapping all the possiblevalues of the syntax elements to a set of bin strings. The bin may meanone-digit binary value. For example, “0” or “1” may be called a singlebin. The bin string may mean a binary sequence configured with bins, forexample the bin string may be continuous binary values, such as “01.”

In one embodiment, syntax elements of intra prediction mode informationand corresponding binarization may be the same as Table 12.

TABLE 12 Binarization Syntax structure Syntax element Process Inputparameters coding_quadtree( ) qt_split_cu_flag[ ][ ] FL cMax = 1multi_type_tree( ) mtt_split_cu_flag FL cMax = 1mtt_split_cu_vertical_flag FL cMax = 1 mtt_split_cu_binary_flag FL cMax= 1 coding_tree_unit( ) alf_ctb_flag[ ][ ][ ] FL cMax = 1 coding_unit( )cu_skip_flag[ ][ ] FL cMax = 1 prod mode flag FL cMax − 1intra_luma_mpm_flag[ ][ ] FL cMax − 1 intra luma mpm idx[ ][ ] TR cMax −5, cRiceParam − 0 intra_luma_mpm_remainder[ ][ ] TB cMax = 60intra_chroma_pred_mode[ ][ ] 9.5.3.6 — merge_affine_flag[ ][ ] FL cMax =1 merge_flag[ ][ ] FL cMax = 1 merge_idx[ ][ ] TR cMax = MaxNumMergeCand− 1, cRiceParam = 0 inter_pred_idc[ x0 ][ y0 ] 9.5.3.7 —inter_affine_flag[ ][ ] FL cMax = 1 cu_affine_type_flag[ ][ ] FL cMax =1 ref_idx_l0[ ][ ] TR cMax = num_ref_idx_l0_active_minus1, cRiceParam =0 mvp_l0_flag[ ][ ] FL cMax = 1 ref_idx_l1[ ][ ] TR cMax −num_ref_idx_l1_active_minus1, cRiceParam = 0 mvpl1_flag[ ][ ] FL cMax =1 amvr_mode[ ][ ] TR cMax = 2, cRiceParam = 0 cu_cbf FL cMax = 1mvd_coding( ) abs_mvd_greater0_flag[ ] FL cMax − 1abs_mvd_greater1_flag[ ] FL cMax − 1 abs_mvd_minus2[ ] EG1 —mvd_sign_flag[ ] FL cMax = 1 transform_unit( ) tu cbf luma[ ][ ][ ] FLcMax − 1 tu_cbf_cb[ ][ ][ ] FL cMax = 1 tu_cbf_cr[ ][ ][ ] FL cMax = 1cu_mts_flag[ ][ ] FL cMax = 1 residual_coding( ) transform_skip_flag[ ][][ ] FL cMax = 1 last_sig_coeff_x_prefix TR cMax = ( log2TrafoSize << 1) 1, cRiceParam = 0 last_sig_coeff_y_prefix TR cMax = ( log2TrafoSize <<1 ) − 1, cRiceParam = 0 last_sig_coeff_x_suffix FL cMax = ( 1 << ( (last_sig_coeff_x_prefix >> 1 ) − 1 ) − 1 ) last_sig_coeff_y_suffix FLcMax = ( 1 << ( ( last_sig_coeff_y_prefix >> 1 ) − 1 ) − 1 )coded_sub_block_flag[ ][ ] FL cMax = 1 sig coeff flag[ ][ ] FL cMax = 1par level flag[ ] FL cMax − 1 rem_abs_gt1_flag[ ] FL cMax = 1rem_abs_gt2_flag[ ] FL cMax = 1 abs_remainder[ ] 9.5.3.8 cIdx, x0, y0,xC, yC, log2TbWidth, log2TbHeight coeff_sign_flag[ ] FL cMax − 1mts_idx[ ][ ] FL cMax − 3

Referring to Table 12, the “intra_luma_mpm_flag” syntax elementrepresenting an MPM flag may be encoded/decoded by applying afixed-length (FL) binarization process to the “intra_luma_mpm_flag”syntax element. The “intra_luma_mpm_idx” syntax element representing anMPM index may be encoded/decoded by applying a truncated rice (TF)binarization process to the “intra_luma_mpm_idx” syntax element. The“intra_luma_mpm_remainder” syntax element representing a remaining modemay be encoded/decoded by applying a truncated binary (TB) binarizationprocess to the “intra_luma_mpm_remainder” syntax element.

According to an embodiment of this document, as described above, theexisting 35 intra prediction modes may be extended and thus the 67 intraprediction modes may be used. In this case, in coding intra predictionmode information, a syntax element representing the remaining mode mayrequire 6 bits. However, the number of bits of a syntax elementrepresenting the remaining mode may be reduced according to a codingmethod (i.e., binarization method). That is, as in Table 12, when codingthe syntax element representing the remaining mode, the number of bitscan be reduced and coding efficiency can be enhanced by performingtruncated binary (TB) binarization processing.

In one embodiment, a truncated binary (TB) binarization process, such asTable 13, may be performed on the syntax element representing theremaining mode.

TABLE 13 9.5.3.6 Truncated binary binarization process Inputs to to thisprocess are a request for a truncated binary (TB) binarization and cMax.Outputs of this process is the TB binarization associating each valuesymbolVal with a corresponding bin string. Syntax elements coded astb(v) are truncated binary coded. The range of possible values for thesyntax element is determined first. The range of this syntax element maybe between 0 and cMax, with cMax being greater than or equal to 1.symbolVal which is equal to the value of the syntax element is given bya process specified as follows:  n = cMax + 1  if ( n > 256 ) {   thVal= 1 << 8   th = 8   while( thVal <= n) {   th++   thVal «<<= 1   }  th- -  }  else {    th = Floor ( Log2( n ) ) so that 2^(k) <= n <2^(k+1)  }  val = 1 << th                                (9-9)  b = n -val  symbolVal = read_bits( th )  if( symbolVal >= val - b) {  symbolVal <<= 1   symbolVal += read_bits( 1 )   symbolVal -= val - b }

Referring to Table 13, when the syntax element(intra_luma_mpm_remainder) representing a remaining mode is input, aTB-binarized value of the syntax element (intra_luma_mpm_remainder) maybe output based on truncated binary (TB) coding. First, the range ofpossible values of the syntax element (intra_luma_mpm_remainder) may bedetermined. The range of the syntax element (intra_luma_mpm_remainder)may be between 0 to cMax. cMax may indicate a maximum value of thesyntax element (intra_luma_mpm_remainder), and may have a value greaterthan or equal to 1. A TB-binarized value (TB bin string) for the valueof the syntax element (intra_luma_mpm_remainder) may be derived based onthe algorithm of Table 13. For example, in Table 14, in the case of thesyntax element (intra_luma_mpm_remainder) representing a remaining mode,cMax is 60. Accordingly, the syntax element (intra_luma_mpm_remainder)may be represented using 6 bits. However, if binarization coding isperformed on a value of the syntax element (intra_luma_mpm_remainder)representing a remaining mode based on TB coding, such as the algorithmof Table 13, the binarization coding may be performed using the numberof bits smaller than 6 bits based on the value of the syntax element(intra_luma_mpm_remainder). For example, the syntax element(intra_luma_mpm_remainder) representing a remaining mode may be used tovariably generate bits from 1 bit to 5 bits based on a value of thesyntax element, and may be coded by TB coding.

FIG. 15 is a flowchart schematically illustrating an encoding methodwhich may be performed by the encoding apparatus according to anembodiment of this document.

The method disclosed in FIG. 15 may be performed by the encodingapparatus 200 disclosed in FIG. 2 . Specifically, steps S1500 to S1520in FIG. 15 may be performed the predictor 220 and the intra predictor222 disclosed in FIG. 2 . Step S1530 in FIG. 15 may be performed by theentropy encoder 240 disclosed in FIG. 2 . Furthermore, the methoddisclosed in FIG. 15 may include the embodiments disclosed in thisspecification. Accordingly, in FIG. 15 , a detailed description ofcontents that overlap the aforementioned embodiments is omitted or thecontents are described in brief.

Referring to FIG. 15 , the encoding apparatus may configure an MPM listby deriving most probable mode (MPM) candidates for a current blockbased on a neighboring block adjacent to the current block (S1500).

In this case, the neighboring block may include the neighboring block A,the neighboring block B, the neighboring block C, the neighboring blockD, the neighboring block E, the neighboring block F and/or theneighboring block G illustrated in FIG. 11 .

In one embodiment, in configuring an MPM list, two neighboring blocksmay be used. For example, the neighboring block D and the neighboringblock B may be used. The neighboring block D may indicate a leftneighboring block located at the most bottom side among left neighboringblocks neighboring the left of the current block. The neighboring blockB may indicate an upper neighboring block located on the most right sideamong neighboring blocks neighboring the upper of the current block.

The encoding apparatus may derive a first MPM candidate based on a firstneighboring block (neighboring block D), and may derive a second MPMcandidate based on a second neighboring block (neighboring block B).

For example, if the first neighboring block is available and an intraprediction has been applied to the first neighboring block, the firstMPM candidate may be derived as an intra prediction mode of the firstneighboring block. If the first neighboring block is not available or anintra prediction has not been applied to the first neighboring block,the first MPM candidate may be derived as a planar intra predictionmode.

Furthermore, for example, if the second neighboring block is available,an intra prediction has been applied to the second neighboring block,and the second neighboring block is included in a current CTU, thesecond MPM candidate may be derived as an intra prediction mode of thesecond neighboring block. If the second neighboring block is notavailable or an intra prediction has not been applied to the secondneighboring block or the second neighboring block is not included in acurrent CTU, the second MPM candidate may be derived as the planar intraprediction mode.

The encoding apparatus may configure an MPM list based on the first MPMcandidate and second MPM candidate derived as described above. In thiscase, the remaining MPM candidates may be derived, including the firstMPM candidate and the second MPM candidate, depending on the number ofcandidates of an MPM list. As described above, the number of candidatesincluded in the MPM list may be different depending on an algorithm, andmay be 3, 4, 5 or 6, for example. Furthermore, as described above, MPMcandidates may be additionally derived according to predeterminedconditions based on the first MPM candidate derived from the firstneighboring block and the second MPM candidate derived from the secondneighboring block.

For example, the encoding apparatus may determine whether the first MPMcandidate and the second MPM candidate are the same, and may determinewhether the mode number of the first MPM candidate or the second MPMcandidate is greater than the mode number of a DC mode. In this case,when the first MPM candidate and the second MPM candidate are not thesame, the encoding apparatus may determine whether each of the first MPMcandidate and the second MPM candidate has a greater mode number thanthe DC mode or whether any one of the first MPM candidate and the secondMPM candidate has a greater mode number than the DC mode. Furthermorewhen each of the first MPM candidate and the second MPM candidate has agreater mode number than the DC mode, the encoding apparatus maydetermine based on a difference between the mode numbers of the firstMPM candidate and the second MPM candidate (e.g., whether a differencebetween the mode numbers of the two candidates is 1 or 2, or is greaterthan or equal to 62). As described above, the encoding apparatus maydifferently configure an MPM list based on whether such a condition issatisfied based on the first MPM candidate and the second MPM candidate.For example, the MPM list may include 6 MPM candidates. In this case,the encoding apparatus may derive 6 MPM candidates, including the firstMPM candidate and the second MPM candidate, based on whether such acondition is satisfied. In this case, the 6 MPM candidates may be mappedto corresponding 0˜5 index values, and may be indicated within the MPMlist based on the index values. Accordingly, the encoding apparatus mayindicate any one of the MPM candidates within the MPM list by signalingindex information.

The aforementioned process of generating an MPM list by deriving MPMcandidates based on neighboring blocks of a current block is only anexample. An MPM list may be constructed using various methods byconsidering coding efficiency. Furthermore, various embodiments forconfiguring an MPM list, described in this document, may be applied tothe process of generating an MPM list. This has been described in detailwith reference to FIGS. 12 to 14 , Table 1 to Table 13, and adescription thereof is omitted in the present embodiment.

The encoding apparatus may determine an intra prediction mode for thecurrent block (S1510).

In one embodiment, the encoding apparatus may derive an intra predictionmode having an optimal rate-distortion (RD) cost by performing variousintra prediction modes on the current block, and may determine the intraprediction mode as an intra prediction mode of the current block. Inthis case, the encoding apparatus may derive the best intra predictionmode of the current block based on intra prediction modes, including 2non-directional intra prediction modes and 65 intra directionalprediction modes. The 67 intra prediction modes are the same as thosedescribed above with reference to FIG. 10 .

Furthermore, the encoding apparatus may generate information related tothe intra prediction mode of the current block. The information relatedto the intra prediction mode is information for indicating the intraprediction mode of the current block, and may include MPM flaginformation, MPM index information, remaining mode information, etc.

In one embodiment, the encoding apparatus may determine whether thedetermined intra prediction mode of the current block is included in theMPM candidates within the MPM list, and may generate MPM flaginformation based on a result of the determination. For example, if theintra prediction mode of the current block is included in the MPMcandidates within the MPM list, the encoding apparatus may set the MPMflag information to 1. Alternatively, if the intra prediction mode ofthe current block is not included in the MPM candidates within the MPMlist, the encoding apparatus may set the MPM flag information to 0.

Furthermore, if the intra prediction mode of the current block isincluded in the MPM candidates within the MPM list, the encodingapparatus may generate MPM index information indicating the intraprediction mode of the current block among the MPM candidates. Forexample, if the MPM list is configured with 6 MPM candidates, MPM indexinformation may be 0˜5 index values.

If the intra prediction mode of the current block is not included in theMPM candidates within the MPM list, the encoding apparatus may generateremaining mode information indicating the intra prediction mode of thecurrent block among remaining intra prediction modes except the MPMcandidates. For example, as described above, if the 67 intra predictionmodes are used and the MPM list is constructed to include 6 MPMcandidates, remaining intra prediction modes may include 61 modesobtained by subtracting the number of MPM candidates from a total numberof intra prediction modes. Accordingly, remaining mode information mayindicate 0˜60 index values.

The encoding apparatus may generate prediction samples for the currentblock by performing an intra prediction based on the determined intraprediction mode of the current block (S1520).

In one embodiment, the encoding apparatus may derive at least one ofneighboring samples of a current block based on an intra predictionmode, and may generate prediction samples based on the neighboringsample. In this case, the neighboring samples may include the top leftcorner neighboring sample, top neighboring samples and left neighboringsamples of the current block. For example, if the size of a currentblock is W×H and an x component and y component at the top-left sampleposition of the current block are xN and yN, left neighboring samplesmay be p[xN−1][yN] to p[xN−1][2H+yN−1], a top left corner neighboringsample may be p[xN−1][yN−1], and top neighboring samples may bep[xN][yN−1] to p[2 W+xN−1][yN−1].

The encoding apparatus may encode image information including theinformation related to the intra prediction mode of the current block(S1530).

That is, the encoding apparatus may generate information related to theintra prediction mode, including at least one of the aforementioned MPMflag information, MPM index information, and remaining mode information,and may encode the information related to the intra prediction mode.

The number of bits is further necessary in order to indicate remainingmode information because the number of intra prediction modes isextended to 67 as described above. Accordingly, in order to enhancecoding efficiency, a truncated binary (TB) binarization method may beused to encode the remaining mode information.

In one embodiment, the encoding apparatus may encode the aforementionedMPM flag information, MPM index information or remaining modeinformation based on a binarization process. In this case, thebinarization process may be performed on the MPM flag information, MPMindex information or remaining mode information based on predeterminedbinarization type information. This may be the same as Table 12.According to Table 12, the remaining mode information has beenpre-defined as a truncated binary (TB) binarization type.

MPM candidates may be derived based on the 67 intra prediction modesincluding the 2 non-directional intra prediction modes and 65directional intra prediction mode as described above. Accordingly, theremaining mode information may represent indication information for anintra prediction mode, derived based on remaining intra prediction modesexcept the number of MPM candidates (e.g., 6) among the 67 intraprediction modes, as a value of a syntax element. For example, the valueof the syntax element indicating the remaining mode information may berepresented as index values (e.g., values of 0 to 60) for indicating 61intra prediction modes.

In one embodiment, the value of the syntax element indicating theremaining mode information may be derived by performing a truncatedbinary (TB) binarization process based on the algorithm of Table 13. Asdescribed above, the remaining mode information is represented as avalue of a syntax element. A maximum range cMax of the value of thesyntax element for the remaining mode information may be 60 as describedin Table 12. Accordingly, according to the algorithm of Table 13, when avalue of a syntax element representing remaining mode information issmaller than a specific value derived based on the number of remainingintra prediction modes (i.e., cMax) except MPM candidates, the value ofthe syntax element representing the remaining mode information may be avalue derived using a variable number of bits from 1 bit to 5 bits basedon a truncated binary (TB) binarization process. In an opposite case,the value of the syntax element representing the remaining modeinformation may be derived as a 6-bit value based on a truncated binary(TB) binarization process. The number of bits can be reduced dependingon a value of a syntax element by applying a truncated binary (TB)binarization process to remaining mode information as in Table 13.

Furthermore, although not illustrated, the encoding apparatus may deriveresidual samples for the current block based on the original samples andprediction samples for the current block, and may generate informationrelated to a residual for the current block based on residual samples.Furthermore, the encoding apparatus may encode image informationincluding the information related to the residual, and may output theimage information in a bitstream form.

The bitstream may be transmitted to the decoding apparatus over anetwork or through a (digital) storage medium. In this case, the networkmay include a broadcasting network and/or a communication network. Thedigital storage medium may include various storage media, such as a USB,an SD, a CD, a DVD, Blueray, an HDD, and an SSD.

The process of deriving a residual sample for a current block may beperformed by the subtractor 231 of the encoding apparatus 200 disclosedin FIG. 2 . The process of generating information related to a residualmay be performed by the transformer 232 of the encoding apparatus 200disclosed in FIG. 2 . The process of encoding image informationincluding information related to a residual may be performed by theentropy encoder 240 of the encoding apparatus 200 disclosed in FIG. 2 .

FIG. 16 is a flowchart schematically illustrating a decoding methodwhich may be performed by the decoding apparatus according to anembodiment of this document.

The method disclosed in FIG. 16 may be performed by the decodingapparatus 300 disclosed in FIG. 3 . Specifically, steps S1600˜S1620 inFIG. 16 may be performed by the predictor 330 and the intra predictor331 disclosed in FIG. 3 . Step S1630 in FIG. 16 may be performed by theadder 340 disclosed in FIG. 3 . Furthermore, in FIG. 16 , step S1610 maybe performed by the entropy decoder 310 disclosed in FIG. 3 .Furthermore, the method disclosed in FIG. 16 may include the embodimentsdescribed in this specification. Accordingly, in FIG. 16 , a detaileddescription of contents that overlap the aforementioned embodiments isomitted or the contents are described in brief.

Referring to FIG. 16 , the decoding apparatus may configure an MPM listby deriving most probable mode (MPM) candidates for a current blockbased on a neighboring block adjacent to the current block (S1600).

In this case, the neighboring block may include the neighboring block A,the neighboring block B, the neighboring block C, the neighboring blockD, the neighboring block E, the neighboring block F and/or theneighboring block G illustrated in FIG. 11 .

In one embodiment, in configuring an MPM list, two neighboring blocksmay be used. For example, the neighboring block D and the neighboringblock B may be used. The neighboring block D may indicate a leftneighboring block located at the most bottom side among left neighboringblocks neighboring the left of the current block. The neighboring blockB may indicate an upper neighboring block located on the most right sideamong neighboring blocks neighboring the upper of the current block.

The decoding apparatus may derive a first MPM candidate based on a firstneighboring block (neighboring block D), and may derive a second MPMcandidate based on a second neighboring block (neighboring block B).

For example, if the first neighboring block is available and an intraprediction has been applied to the first neighboring block, the firstMPM candidate may be derived as an intra prediction mode of the firstneighboring block. If the first neighboring block is not available or anintra prediction has not been applied to the first neighboring block,the first MPM candidate may be derived as a planar intra predictionmode.

Furthermore, for example, if the second neighboring block is available,an intra prediction has been applied to the second neighboring block,and the second neighboring block is included in a current CTU, thesecond MPM candidate may be derived as an intra prediction mode of thesecond neighboring block. If the second neighboring block is notavailable or an intra prediction has not been applied to the secondneighboring block or the second neighboring block is not included in acurrent CTU, the second MPM candidate may be derived as the planar intraprediction mode.

The decoding apparatus may configure an MPM list based on the first MPMcandidate and second MPM candidate derived as described above. In thiscase, the remaining MPM candidates may be derived, including the firstMPM candidate and the second MPM candidate, depending on the number ofcandidates of an MPM list. As described above, the number of candidatesincluded in the MPM list may be different depending on an algorithm, andmay be 3, 4, 5 or 6, for example. Furthermore, as described above, MPMcandidates may be additionally derived according to predeterminedconditions based on the first MPM candidate derived from the firstneighboring block and the second MPM candidate derived from the secondneighboring block.

For example, the decoding apparatus may determine whether the first MPMcandidate and the second MPM candidate are the same, and may determinewhether the mode number of the first MPM candidate or the second MPMcandidate is greater than the mode number of a DC mode. In this case,when the first MPM candidate and the second MPM candidate are not thesame, the decoding apparatus may determine whether each of the first MPMcandidate and the second MPM candidate has a greater mode number thanthe DC mode or whether any one of the first MPM candidate and the secondMPM candidate has a greater mode number than the DC mode. Furthermorewhen each of the first MPM candidate and the second MPM candidate has agreater mode number than the DC mode, the decoding apparatus maydetermine based on a difference between the mode numbers of the firstMPM candidate and the second MPM candidate (e.g., whether a differencebetween the mode numbers of the two candidates is 1 or 2, or is greaterthan or equal to 62). As described above, the decoding apparatus maydifferently configure an MPM list based on whether such a condition issatisfied based on the first MPM candidate and the second MPM candidate.For example, the MPM list may include 6 MPM candidates. In this case,the decoding apparatus may derive 6 MPM candidates, including the firstMPM candidate and the second MPM candidate, based on whether such acondition is satisfied. In this case, the 6 MPM candidates may be mappedto corresponding 0˜5 index values, and may be indicated within the MPMlist based on the index values. Accordingly, the decoding apparatus maydetermine which candidate of MPM candidates within an MPM list isindicated based on index information signaled by the encoding apparatus.

The aforementioned process of generating an MPM list by deriving MPMcandidates based on neighboring blocks of a current block is only anexample. An MPM list may be constructed using various methods byconsidering coding efficiency. Furthermore, various embodiments forconfiguring an MPM list, described in this document, may be applied tothe process of generating an MPM list. This has been described in detailwith reference to FIGS. 12 to 14 , Table 1 to Table 13, and adescription thereof is omitted in the present embodiment.

The decoding apparatus may derive an intra prediction mode of thecurrent block based on the MPM list (S1610).

In one embodiment, the decoding apparatus may obtain information relatedto the intra prediction mode of the current block from a bitstream. Theinformation related to the intra prediction mode is information forindicating the intra prediction mode of the current block, and mayinclude MPM flag information, MPM index information, remaining modeinformation, etc.

First, the decoding apparatus may obtain MPM flag information indicatingwhether the intra prediction mode of the current block is included inthe MPM candidates within the MPM list. Furthermore, the decodingapparatus may obtain MPM index information or remaining mode informationbased on the MPM flag information.

For example, when the MPM flag information indicates 1, the decodingapparatus may determine that the intra prediction mode of the currentblock is included in the MPM candidates within the MPM list. In thiscase, the decoding apparatus may obtain MPM index information indicatingthe intra prediction mode of the current block among the MPM candidates.The decoding apparatus may derive, as the intra prediction mode of thecurrent block, an MPM candidate indicated by the MPM index informationwithin the MPM list.

When the MPM flag information indicates 0, the decoding apparatus maydetermine that the intra prediction mode of the current block is notincluded in the MPM candidates within the MPM list. In this case, thedecoding apparatus may obtain remaining mode information indicating theintra prediction mode of the current block among remaining intraprediction modes except the MPM candidates. The decoding apparatus mayderive, as the intra prediction mode of the current block, an intraprediction mode indicated by the remaining mode information.

The number of bits is further necessary in order to indicate remainingmode information because the number of intra prediction modes isextended to 67 as described above. Accordingly, in order to enhancecoding efficiency, the remaining mode information may be obtained bydecoding it using a truncated binary (TB) binarization method.

In one embodiment, the decoding apparatus may decode the aforementionedMPM flag information, MPM index information or remaining modeinformation based on a binarization process. In this case, thebinarization process may be performed on the MPM flag information, MPMindex information or remaining mode information based on predeterminedbinarization type information. This may be the same as Table 12.According to Table 12, the remaining mode information has beenpre-defined as a truncated binary (TB) binarization type.

MPM candidates may be derived based on the 67 intra prediction modesincluding the 2 non-directional intra prediction modes and 65directional intra prediction mode as described above. Accordingly, theremaining mode information may represent indication information for anintra prediction mode, derived based on remaining intra prediction modesexcept the number of MPM candidates (e.g., 6) among the 67 intraprediction modes, as a value of a syntax element. For example, the valueof the syntax element indicating the remaining mode information may berepresented as index values (e.g., values of 0 to 60) for indicating 61intra prediction modes.

In one embodiment, the value of the syntax element indicating theremaining mode information may be derived by performing a truncatedbinary (TB) binarization process based on the algorithm of Table 13. Asdescribed above, the remaining mode information is represented as avalue of a syntax element. A maximum range cMax of the value of thesyntax element for the remaining mode information may be 60 as describedin Table 12. Accordingly, according to the algorithm of Table 13, when avalue of a syntax element representing remaining mode information issmaller than a specific value derived based on the number of remainingintra prediction modes (i.e., cMax) except MPM candidates, the value ofthe syntax element representing the remaining mode information may be avalue derived using a variable number of bits from 1 bit to 5 bits basedon a truncated binary (TB) binarization process. In an opposite case,the value of the syntax element representing the remaining modeinformation may be derived as a 6-bit value based on a truncated binary(TB) binarization process. The number of bits can be reduced dependingon a value of a syntax element by applying a truncated binary (TB)binarization process to remaining mode information as in Table 13.

The decoding apparatus may generate prediction samples for the currentblock by performing an intra prediction on the current block based onthe derived intra prediction mode (S1620).

In one embodiment, the decoding apparatus may derive at least one ofneighboring samples of a current block based on an intra predictionmode, and may generate prediction samples based on the neighboringsample. In this case, the neighboring samples may include the top leftcorner neighboring sample, top neighboring samples and left neighboringsamples of the current block. For example, if the size of a currentblock is W×H and an x component and y component at the top-left sampleposition of the current block are xN and yN, left neighboring samplesmay be p[xN−1][yN] to p[xN−1][2H+yN−1], a top left corner neighboringsample may be p[xN−1][yN−1], and top neighboring samples may bep[xN][yN−1] to p[2 W+xN−1][yN−1].

The decoding apparatus may generate a reconstructed picture for thecurrent block based on the prediction samples (S1630).

In one embodiment, the decoding apparatus may use the prediction samplesdirectly as reconstructed samples based on a prediction mode or maygenerate reconstructed samples by adding residual samples to theprediction samples.

If a residual sample for the current block is present, the decodingapparatus may receive information related to a residual for the currentblock. The information related to the residual may include a transformcoefficient related to residual samples. The decoding apparatus mayderive residual samples (or residual sample array) for the current blockbased on the residual information. The decoding apparatus may generatereconstructed samples based on the prediction samples and the residualsamples, and may derive a reconstructed block or reconstructed picturebased on the reconstructed samples. Thereafter, the decoding apparatusmay apply an in-loop filtering procedure, such as deblocking filteringand/or an SAO procedure, to the reconstructed picture in order toenhance subjective/object picture quality, as described above.

In the aforementioned embodiments, although the methods have beendescribed based on the flowcharts in the form of a series of steps orunits, the embodiments of this document are not limited to the order ofthe steps, and some of the steps may be performed in a different orderfrom that of other steps or may be performed simultaneous to othersteps. Furthermore, those skilled in the art will understand that thesteps shown in the flowchart are not exclusive and the steps may includeadditional steps or that one or more steps in the flowchart may bedeleted without affecting the scope of rights of this document.

The aforementioned method according to this document may be implementedin a software form, and the encoding apparatus and/or the decodingapparatus according to this document may be included in an apparatus forperforming image processing, for example, TV, a computer, a smartphone,a set-top box or a display device.

In this document, when embodiments are implemented in a software form,the aforementioned method be implemented as a module (process, function,etc.) for performing the aforementioned function. The module may bestored in the memory and executed by the processor. The memory may beplaced inside or outside the processor and connected to the processor byvarious well-known means. The processor may include application-specificintegrated circuits (ASICs), other chipsets, logic circuits and/or dataprocessing devices. The memory may include read-only memory (ROM),random access memory (RAM), flash memory, memory cards, storage mediaand/or other storage devices. That is, the embodiments described in thisdocument may be implemented and performed on a processor, a microprocessor, a controller or a chip. For example, the function unitsillustrated in the drawings may be implemented and performed on acomputer, a processor, a micro processor, a controller or a chip. Inthis case, information (e.g., information on instructions) or analgorithm for such implementation may be stored in a digital storagemedium.

Furthermore, the decoding apparatus and the encoding apparatus to whichthis document is applied may be included in a multimedia broadcastingtransmission and reception device, a mobile communication terminal, ahome cinema video device, a digital cinema video device, a camera formonitoring, a video dialogue device, a real-time communication devicesuch as video communication, a mobile streaming device, a storagemedium, a camcorder, a video on-demand (VoD) service provision device,an over the top (OTT) video device, an Internet streaming serviceprovision device, a three-dimensional (3D) video device, a virtualreality (VR) device, an augmented reality (AR) device, a video telephonydevice, transportation means terminal (e.g., a vehicle (includingautonomous vehicle) terminal, an aircraft terminal, and a vesselterminal), and a medical video device, and may be used to process avideo signal or a data signal. For example, the over the top (OTT) videodevice may include a game console, a Blueray player, Internet access TV,a home theater system, a smartphone, a tablet PC, and a digital videorecorder (DVR).

Furthermore, the processing method to which this document is applied maybe produced in the form of a program executed by a computer, and may bestored in a computer-readable recording medium. Multimedia data having adata structure according to this document may also be stored in acomputer-readable recording medium. The computer-readable recordingmedium includes all types of storage devices in which computer-readabledata is stored. The computer-readable recording medium may includeBlueray disk (BD), a universal serial bus (USB), a ROM, a PROM, anEPROM, an EEPROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, andan optical data storage device, for example. Furthermore, thecomputer-readable recording medium includes media implemented in theform of carriers (e.g., transmission through the Internet). Furthermore,a bit stream generated using an encoding method may be stored in acomputer-readable recording medium or may be transmitted over wired andwireless communication networks.

Furthermore, an embodiment of this document may be implemented as acomputer program product using program code. The program code may beperformed by a computer according to an embodiment of this document. Theprogram code may be stored on a carrier readable by a computer.

FIG. 17 illustrates an example of a content streaming system to whichembodiments disclosed in this document may be applied.

Referring to FIG. 17 , the content streaming system to which theembodiments of the present document are applied may basically include anencoding server, a streaming server, a web server, a media storage, auser device, and a multimedia input device.

The encoding server compresses content input from multimedia inputdevices such as a smartphone, a camera, a camcorder, etc. into digitaldata to generate a bitstream and transmit the bitstream to the streamingserver. As another example, when the multimedia input devices such assmartphones, cameras, camcorders, etc. directly generate a bitstream,the encoding server may be omitted.

The bitstream may be generated by an encoding method or a bitstreamgenerating method to which the embodiments of the present document isapplied, and the streaming server may temporarily store the bitstream inthe process of transmitting or receiving the bitstream.

The streaming server transmits the multimedia data to the user devicebased on a user's request through the web server, and the web serverserves as a medium for informing the user of a service. When the userrequests a desired service from the web server, the web server deliversit to a streaming server, and the streaming server transmits multimediadata to the user. In this case, the content streaming system may includea separate control server. In this case, the control server serves tocontrol a command/response between devices in the content streamingsystem.

The streaming server may receive content from a media storage and/or anencoding server. For example, when the content is received from theencoding server, the content may be received in real time. In this case,in order to provide a smooth streaming service, the streaming server maystore the bitstream for a predetermined time.

Examples of the user device may include a mobile phone, a smartphone, alaptop computer, a digital broadcasting terminal, a personal digitalassistant (PDA), a portable multimedia player (PMP), navigation, a slatePC, tablet PCs, ultrabooks, wearable devices (ex. smartwatches, smartglasses, head mounted displays), digital TV, desktops computer, digitalsignage, and the like.

Each server in the content streaming system may be operated as adistributed server, in which case data received from each server may bedistributed.

1-14. (canceled)
 15. A video decoding method performed by a decodingapparatus, the method comprising: constructing candidate mode list byderiving candidate modes for a current block based on neighboring blocksadjacent to the current block, wherein the neighboring blocks comprisesa left neighboring block and an upper neighboring block; deriving anintra prediction mode for the current block based on the candidate modelist; generating predicted samples by performing prediction for thecurrent block based on the intra prediction mode; and generating areconstructed picture for the current block based on the predictedsamples, wherein the step of constructing the candidate mode listincludes: checking a condition 1 whether an intra prediction mode of theleft neighboring block and an intra prediction mode of the upperneighboring block are the same intra prediction mode; checking acondition 2 whether a mode number of the intra prediction mode of theleft neighboring block is greater than a mode number of a DC mode, basedon a case where the condition 1 is satisfied; checking a condition 3whether the mode number of the intra prediction mode of the leftneighboring block and a mode number of the intra prediction mode of theupper neighboring block are greater than the mode number of the DC mode,based on a case where the condition 1 is not satisfied; checking acondition 4 whether a difference between the mode number of the intraprediction mode of the left neighboring block and the mode number of theintra prediction mode of the upper neighboring block is equal to 1,based on a case where the condition 3 is satisfied; checking a condition5 whether one of the mode number of the intra prediction mode of theleft neighboring block and the mode number of the intra prediction modeof the upper neighboring block is greater than the mode number of the DCmode, based on a case where the condition 3 is not satisfied;constructing the candidate mode list based on at least one of thecondition 1 to the condition 5, wherein the step of deriving the intraprediction mode for the current block includes: obtaining Most ProbableMode (MPM) flag information related to whether the intra prediction modefor the current block is included among the candidate modes; obtainingremaining mode information for indicating the intra prediction mode forthe current block among remaining intra prediction modes except for thecandidate modes, based on the MPM flag information representing that theintra prediction mode for the current block is not included among thecandidate modes; and deriving the intra prediction mode for the currentblock based on the remaining mode information, wherein the remainingmode information is obtained based on a truncated binary (TB)binarization process.
 16. The video decoding method of claim 15, whereinthe candidate mode list is constructed as one of a candidate mode list 1to a candidate mode list 5, based on the condition 1 to the condition 5,wherein the candidate mode list 1 includes candidate modes derived basedon a case where the condition 1 and the condition 2 are satisfied,wherein the candidate mode list 2 includes candidate modes derived basedon a case where the condition 1 is satisfied and the condition 2 is notsatisfied, wherein the candidate mode list 3 includes candidate modesderived based on a case where the condition 1 and the condition 3 arenot satisfied and the condition 5 is satisfied, wherein the candidatemode list 4 includes candidate modes derived based on a case where thecondition 1 is not satisfied and the condition 3 is satisfied and thecondition 4 is not satisfied, wherein the candidate mode list 5 includescandidate modes derived based on a case where the condition 1 is notsatisfied and the condition 3 and the condition 4 are satisfied.
 17. Thevideo decoding method of claim 15, wherein the candidate modes arederived based on 67 intra prediction modes, including 2 non-directionalintra prediction modes and 65 directional intra prediction modes, andwherein the remaining mode information represents, as a value of asyntax element, indication information for an intra prediction modederived based on the remaining intra prediction modes except the numberof candidate modes among the 67 intra prediction modes.
 18. The videodecoding method of claim 17, wherein the value of the syntax elementrepresenting the remaining mode information is a value derived using avariable number of bits from 1 bit to 5 bits based on the truncatedbinary (TB) binarization process.
 19. The video decoding method of claim17, wherein based on the value of the syntax element representing theremaining mode information being smaller than a specific value derivedbased on the number of remaining intra prediction modes, the value ofthe syntax element representing the remaining mode information is avalue derived using a variable number of bits from 1 bit to 5 bits basedon the truncated binary (TB) binarization process.
 20. The videodecoding method of claim 15, wherein the left neighboring block islocated on a most bottom side among neighboring blocks neighboring aleft boundary of the current block and the upper neighboring block islocated on a most right side among neighboring blocks neighboring anupper boundary of the current block.
 21. A video encoding methodperformed by an encoding apparatus, the method comprising: constructingcandidate mode list by deriving candidate modes for a current blockbased on neighboring blocks adjacent to a current block, wherein theneighboring blocks comprises a left neighboring block and an upperneighboring block; determining an intra prediction mode for the currentblock; generating prediction samples by performing a prediction for thecurrent block based on the intra prediction mode; and encoding imageinformation including intra prediction mode information for the currentblock, wherein the step of constructing the candidate mode listincludes: checking a condition 1 whether an intra prediction mode of theleft neighboring block and an intra prediction mode of the upperneighboring block are the same intra prediction mode; checking acondition 2 whether a mode number of the intra prediction mode of theleft neighboring block is greater than a mode number of a DC mode, basedon a case where the condition 1 is satisfied; checking a condition 3whether the mode number of the intra prediction mode of the leftneighboring block and a mode number of the intra prediction mode of theupper neighboring block are greater than the mode number of the DC mode,based on a case where the condition 1 is not satisfied; checking acondition 4 whether a difference between the mode number of the intraprediction mode of the left neighboring block and the mode number of theintra prediction mode of the upper neighboring block is equal to 1,based on a case where the condition 3 is satisfied; checking a condition5 whether one of the mode number of the intra prediction mode of theleft neighboring block and the mode number of the intra prediction modeof the upper neighboring block is greater than the mode number of the DCmode, based on a case where the condition 3 is not satisfied;constructing the candidate mode list based on at least one of thecondition 1 to the condition 5, wherein the step of determining theintra prediction mode for the current block includes: generating MostProbable Mode (MPM) flag information based on whether the intraprediction mode for the current block is included among the candidatemodes; and generating remaining mode information for indicating theintra prediction mode for the current block among remaining intraprediction modes except the candidate modes, based on the MPM flaginformation representing that the intra prediction mode for the currentblock is not included among the candidate modes, wherein the MPM flaginformation and the remaining mode information are included and encodedin the intra prediction mode information, and wherein the remaining modeinformation is encoded based on a truncated binary (TB) binarizationprocess.
 22. The video encoding method of claim 21, wherein thecandidate mode list is constructed as one of a candidate mode list 1 toa candidate mode list 5, based on the condition 1 to the condition 5,wherein the candidate mode list 1 includes candidate modes derived basedon a case where the condition 1 and the condition 2 are satisfied,wherein the candidate mode list 2 includes candidate modes derived basedon a case where the condition 1 is satisfied and the condition 2 is notsatisfied, wherein the candidate mode list 3 includes candidate modesderived based on a case where the condition 1 and the condition 3 arenot satisfied and the condition 5 is satisfied, wherein the candidatemode list 4 includes candidate modes derived based on a case where thecondition 1 is not satisfied and the condition 3 is satisfied and thecondition 4 is not satisfied, wherein the candidate mode list 5 includescandidate modes derived based on a case where the condition 1 is notsatisfied and the condition 3 and the condition 4 are satisfied.
 23. Thevideo encoding method of claim 21, wherein the candidate modes arederived based on 67 intra prediction modes, including 2 non-directionalintra prediction modes and 65 directional intra prediction modes, andwherein the remaining mode information represents, as a value of asyntax element, indication information for an intra prediction modederived based on the remaining intra prediction modes except the numberof candidate modes among the 67 intra prediction modes.
 24. The videoencoding method of claim 23, wherein the value of the syntax elementrepresenting the remaining mode information is a value derived using avariable number of bits from 1 bit to 5 bits based on the truncatedbinary (TB) binarization process.
 25. The video encoding method of claim23, wherein based on the value of the syntax element representing theremaining mode information being smaller than a specific value derivedbased on the number of remaining intra prediction modes, the value ofthe syntax element representing the remaining mode information is avalue derived using a variable number of bits from 1 bit to 5 bits basedon the truncated binary (TB) binarization process.
 26. The videoencoding method of claim 21, wherein the left neighboring block islocated on a most bottom side among neighboring blocks neighboring aleft boundary of the current block and the upper neighboring block islocated on a most right side among neighboring blocks neighboring anupper boundary of the current block.
 27. A non-transitorycomputer-readable storage medium storing a bitstream generated by amethod, the method comprising: constructing candidate mode list byderiving candidate modes for a current block based on neighboring blocksadjacent to a current block, wherein the neighboring blocks comprises aleft neighboring block and an upper neighboring block; determining anintra prediction mode for the current block; generating predictionsamples by performing a prediction for the current block based on theintra prediction mode; and encoding image information including intraprediction mode information for the current block, wherein the step ofconstructing the candidate mode list includes: checking a condition 1whether an intra prediction mode of the left neighboring block and anintra prediction mode of the upper neighboring block are the same intraprediction mode; checking a condition 2 whether a mode number of theintra prediction mode of the left neighboring block is greater than amode number of a DC mode, based on a case where the condition 1 issatisfied; checking a condition 3 whether the mode number of the intraprediction mode of the left neighboring block and a mode number of theintra prediction mode of the upper neighboring block are greater thanthe mode number of the DC mode, based on a case where the condition 1 isnot satisfied; checking a condition 4 whether a difference between themode number of the intra prediction mode of the left neighboring blockand the mode number of the intra prediction mode of the upperneighboring block is equal to 1, based on a case where the condition 3is satisfied; checking a condition 5 whether one of the mode number ofthe intra prediction mode of the left neighboring block and the modenumber of the intra prediction mode of the upper neighboring block isgreater than the mode number of the DC mode, based on a case where thecondition 3 is not satisfied; constructing the candidate mode list basedon at least one of the condition 1 to the condition 5, wherein the stepof determining the intra prediction mode for the current block includes:generating Most Probable Mode (MPM) flag information based on whetherthe intra prediction mode for the current block is included among thecandidate modes; and generating remaining mode information forindicating the intra prediction mode for the current block amongremaining intra prediction modes except the candidate modes, based onthe MPM flag information representing that the intra prediction mode forthe current block is not included among the candidate modes, wherein theMPM flag information and the remaining mode information are included andencoded in the intra prediction mode information, and wherein theremaining mode information is encoded based on a truncated binary (TB)binarization process.